Re: Questions about recursive or multiple instances of parser

gneuner@dyn.com (George Neuner)
23 Feb 2000 14:12:18 -0500

          From comp.compilers
Related articles
Questions about recursive or multiple instances of parser olsenc@kodiak.ee.washington.edu (2000-02-12)
Re: Questions about recursive or multiple instances of parser rkrayhawk@aol.com (2000-02-17)
Re: Questions about recursive or multiple instances of parser gneuner@dyn.com (2000-02-23)
| List of all articles for this month |
From: gneuner@dyn.com (George Neuner)
Newsgroups: comp.compilers.tools.pccts,comp.compilers
Date: 23 Feb 2000 14:12:18 -0500
Organization: Dynamic ReSolutions, Inc.
References: 00-02-060
Keywords: tools, PCCTS

On 12 Feb 2000 22:44:03 -0500, olsenc@kodiak.ee.washington.edu (Clint
Olsen) wrote:


>1) Can pccts 1.33 handle recursive instances of its parser in ANSI C?


Yes.


>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
> above.


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.


George Neuner
Dynamic Resolutions, Inc.

Post a followup to this message

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