Re: re-entrant parsers, pure_parser, bison, flex

John Lilley <jlilley@empathy.com>
24 Aug 1997 14:58:08 -0400

          From comp.compilers
Related articles
[2 earlier articles]
Re: re-entrant parsers, pure_parser, bison, flex tiggr@ics.ele.tue.nl (1997-07-16)
Re: re-entrant parsers, pure_parser, bison, flex lmipjmy@eei.ericsson.se (PJ Mealy) (1997-07-18)
Re: re-entrant parsers, pure_parser, bison, flex cfc@world.std.com (1997-07-18)
Re: re-entrant parsers, pure_parser, bison, flex 71511.3711@CompuServe.COM (Brian W. Inglis) (1997-07-21)
Re: re-entrant parsers, pure_parser, bison, flex bear@sonic.net (Ray Dillinger) (1997-07-22)
Re: re-entrant parsers, pure_parser, bison, flex vetter@cc.gatech.edu (Jeffrey Vetter) (1997-07-22)
Re: re-entrant parsers, pure_parser, bison, flex jlilley@empathy.com (John Lilley) (1997-08-24)
| List of all articles for this month |
From: John Lilley <jlilley@empathy.com>
Newsgroups: comp.compilers
Date: 24 Aug 1997 14:58:08 -0400
Organization: Nerds for Hire, Inc.
References: 97-07-063 97-07-110
Keywords: parse, LL(1)

I should also mention that ANTLR 2.0 creates re-entrant LL(k) lexers and
parsers (in Java). Both lexers and parsers are recursive-descent
objects, so they can be multi-threaded, you can create multiple copies,
and you can make recursive calls. See:


      java.magelang.com/antlr


john lilley
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.