Re: Computing first sets on a left-recursive grammar

parag@pinhead.parag.codegen.com (Parag Patel)
14 Apr 2001 17:15:41 -0400

          From comp.compilers
Related articles
Computing first sets on a left-recursive grammar cyrus@stwing.upenn.edu (Cyrus Najmabadi) (2001-04-10)
Re: Computing first sets on a left-recursive grammar paul@parsetec.com (Paul Mann) (2001-04-12)
Re: Computing first sets on a left-recursive grammar soenke.kannapinn@wincor-nixdorf.com (Sönke Kannapinn) (2001-04-12)
Re: Computing first sets on a left-recursive grammar max@max.mcs.gac.edu (Max Hailperin) (2001-04-14)
Re: Computing first sets on a left-recursive grammar parag@pinhead.parag.codegen.com (2001-04-14)
| List of all articles for this month |
From: parag@pinhead.parag.codegen.com (Parag Patel)
Newsgroups: comp.compilers
Date: 14 Apr 2001 17:15:41 -0400
Organization: CodeGen, Inc.
References: 01-04-062 01-04-079
Keywords: LL(1), parse
Posted-Date: 14 Apr 2001 17:15:41 EDT

Hi. My old wacco LL(1) parser-generator has a -D option that dumps out
the input grammar as well as the FIRST and FOLLOW sets. I followed the
algorithms outlined in The Dragon Book ("Compilers: Principles,
Techinques, and Tools" by Aho, Sethi, and Ullman). Wacco will complain
about left-recursive grammars as well as other ambiguities.


You can download it from <http://www.codegen.com/freesoft/wacco.tgz>. I
recently added Java support in addition to the original C/C++
parser-generator, and am working on a Modula-3 back-end.




-- Parag Patel

Post a followup to this message

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