[Commit] mint-2004b tool.tex,1.7,1.8

[Emma Kuo]

Committed by: ekuo

Update of /local/src/CVS/mint-2004b
In directory home.keithp.com:/tmp/cvs-serv26946

Modified Files:
	tool.tex 
Log Message:


Index: tool.tex
===================================================================
RCS file: /local/src/CVS/mint-2004b/tool.tex,v
retrieving revision 1.7
retrieving revision 1.8
diff -u -d -r1.7 -r1.8
--- tool.tex	1 Dec 2004 22:13:03 -0000	1.7
+++ tool.tex	1 Dec 2004 22:35:21 -0000	1.8
@@ -32,11 +32,10 @@
 such as C, MINT generates language independent lexing and
 parsing tables.  These tables can then be loaded by
 lexer/parser libraries (the MINT runtime) implemented in the
-desired target language.  The lexer and parser simple to
-write in an arbitrary language, but need to be written in a
-specific target language.  The table generators are
-difficult to write, and would like written only infrequently
-in a high-level language.  The MINT architecture decouples
+desired target language.  The lexer and parser are simple to
+implement.  Implementing the canonical LR(1) table generation 
+is tedious, and it is preferable to write it only once in a 
+high-level language. The MINT architecture decouples
 table generation from processing, enabling simultaneous
 accomplishment of these goals.
 
@@ -46,7 +45,7 @@
 parse tree. The one action grammar rules may take is to
 change the lexer state (exclusive start condition, in FLEX terminology).
 This restriction is due to the
-impossiblity of specifying arbitrary actions in an unknown
+impossibility of specifying arbitrary actions in an unknown
 target language: the MINT architecture implies that the
 target language is in general unknown.  Changing the lexer
 state (so-called ``lexer feedback'') is necessary for some
@@ -62,7 +61,7 @@
 \end{figure*}
 
 As noted previously, MINT consists of two main components.  The MINT parser
-and lexer generator is implemented in Nickle.  The MINT runtime
+and lexer generators are implemented in Nickle.  The MINT runtime
 is currently implemented in Nickle as well.  However,
 we expect to provide this runtime in  other
 languages as well. In particular, a C MINT runtime will be
@@ -117,8 +116,8 @@
 Lookahead patterns are implemented subject to the same restrictions as
 for FLEX. That is, lookahead patterns such as ``ab*/b'' are
 not currently
-allowed. (However, handling for these sorts of patterns is
-expected to be added shortly.)  The lexer can handle character sets of arbitrary
+allowed. However, handling for these sorts of patterns is
+expected to be added shortly.  The lexer can handle character sets of arbitrary
 size. This is intended primarily for Unicode support. To
 control the size of the resulting tables,
 MINT's lexer implements the lexing table as an