# HG changeset patch
# User urbanc
# Date 1314970485 0
# Node ID 9c281a4b767ddf6f736611c875386e51ad4effe8
# Parent  3be00ad980a19c2292c1c964bb9e569219eb3966
small change

diff -r 3be00ad980a1 -r 9c281a4b767d csupp.pdf
Binary file csupp.pdf has changed
diff -r 3be00ad980a1 -r 9c281a4b767d csupp.tex
--- a/csupp.tex	Fri Sep 02 13:30:17 2011 +0000
+++ b/csupp.tex	Fri Sep 02 13:34:45 2011 +0000
@@ -59,14 +59,14 @@
 parsing algorithms. For this, the algorithms need to be formulated
 in way so that it is easy to reason about them. In earlier work
 about lexing and regular languages, the authors showed that this 
-precludes algorithms working over graphs. However regular
+precludes well-known algorithms working over graphs. However regular
 languages can be formulated and reasoned about entirely in terms 
 regular expressions, which can be easily represented in theorem
 provers. This work uses the device of derivatives of regular 
-languages. We like to extend this work to parsers and grammars.
+expressions. We like to extend this device to parsers and grammars.
 The aim is to come up with elegant and useful parsing algorithms
-whose correctness and absence of bugs can be certified in a theorem 
-prover. 
+whose correctness and the absence of bugs can be certified in a 
+theorem prover. 
 \mbox{}\\[15cm]
 
 \noindent