Related articles |
---|
Naive question from a layman berriz@husc.harvard.edu (GB) (1997-03-14) |
Re: Naive question from a layman jlilley@empathy.com (John Lilley) (1997-03-16) |
From: | John Lilley <jlilley@empathy.com> |
Newsgroups: | comp.compilers |
Date: | 16 Mar 1997 23:32:51 -0500 |
Organization: | Nerds for Hire, Inc. |
References: | 97-03-060 |
Keywords: | parse |
GB wrote:
> I still wonder, though, is there any yacc-like program out there
> that will produce more legible code? (I imagine such a program
> would be useful for little else other than didactic purposes).
PCCTS 1.33 produces LL(k) recursive-descent parsers in C/C++ that are
quite readable.
PCCTS 2.0, which is still under development, will produce Java (and
potentially other languages), and has an LL(1) lexer, which makes the
lexer output quite readable as well. In addition, it will include a
-diagnostic mode that lists all the rules and the parsing decisions
that are made at each junction, including lookahead sets and follow
sets. Very useful for understanding what is going on inside an LL(k)
grammar.
john lilley
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.