[PATCH] specified match precedence in lexer... hope I'm right

From: John Clements (clements at racket-lang.org)
Date: Wed May 1 10:51:40 EDT 2013

---
collects/parser-tools/parser-tools.scrbl |    6 ++++--
1 files changed, 4 insertions(+), 2 deletions(-)

diff --git a/collects/parser-tools/parser-tools.scrbl b/collects/parser-tools/parser-tools.scrbl
index cb3a84f..9bc5ef5 100644
--- a/collects/parser-tools/parser-tools.scrbl
+++ b/collects/parser-tools/parser-tools.scrbl
@@ -51,8 +51,10 @@ style lexer and parser generators.
                   (id datum ...)])]{

     Produces a function that takes an input-port, matches the
-     @racket[re]'s against the buffer, and returns the result of
-     executing the corresponding @racket[action-expr].
+     @racket[re] patterns against the buffer, and returns the result of
+     executing the corresponding @racket[action-expr]. When multiple
+     patterns match, a lexer will choose the longest match, breaking
+     ties in favor of the rule appearing first.

     @margin-note{The implementation of @racketmodname[syntax-color/racket-lexer]
                 contains a lexer for the @racketmodname[racket] language.
-- 
1.7.7.5 (Apple Git-26)




Posted on the users mailing list.