|Questions about recursive or multiple instances of parser email@example.com (2000-02-12)|
|Re: Questions about recursive or multiple instances of parser firstname.lastname@example.org (2000-02-17)|
|Re: Questions about recursive or multiple instances of parser email@example.com (2000-02-23)|
|From:||firstname.lastname@example.org (George Neuner)|
|Date:||23 Feb 2000 14:12:18 -0500|
|Organization:||Dynamic ReSolutions, Inc.|
On 12 Feb 2000 22:44:03 -0500, email@example.com (Clint
>1) Can pccts 1.33 handle recursive instances of its parser in ANSI C?
>2) Can its lexer do the same? I've seen people using flex with antlr, and
> it seems I will have to avoid this to keep from the limitations defined
No. The stock lexer is DFA based like Flex.
If you can work with C++ instead, Antlr 2.x can do this. Both the
compiler and lexer are recursive decent and completely reentrant.
Dynamic Resolutions, Inc.
Return to the
Search the comp.compilers archives again.