Related articles |
---|
Writing Grammars newsham@lava.net (Tim Newsham) (2002-07-25) |
Re: Writing Grammars idbaxter@semdesigns.com (Ira Baxter) (2002-07-31) |
Re: Writing Grammars whopkins@alpha2.csd.uwm.edu (Mark) (2002-07-31) |
Re: Writing Grammars pfroehli@ics.uci.edu (Peter H. Froehlich) (2002-07-31) |
Re: Writing Grammars newsham@lava.net (Tim Newsham) (2002-08-04) |
Re: Writing Grammars parsersinc@yahoo.com (SLK Parsers) (2002-08-04) |
Re: Writing Grammars vbdis@aol.com (VBDis) (2002-08-10) |
From: | "SLK Parsers" <parsersinc@yahoo.com> |
Newsgroups: | comp.compilers |
Date: | 4 Aug 2002 11:43:41 -0400 |
Organization: | Parsers Inc. |
References: | 02-07-118 |
Keywords: | parse |
Posted-Date: | 04 Aug 2002 11:43:40 EDT |
> - start with a grammar of the language
> - modify the grammar to be easy to parse (ie. LALR(1))
> My question is: Are there any tools or research into tools to help
> automate the process of going from step 1 to step 2. It seems that
> this is a very difficult and error-prone step.
SLK attempts to automate much of this for LL(k) parsing. Some of the
relevant command line options are
direct left factor nonterminal or the grammar
indirect left factor nonterminal or the grammar
remove duplicate productions
remove left recursion
remove unused nonterminals
substitute nonterminals for equivalent ones
substitute terminals for equivalent nonterminals
http://parsers.org/slk
Return to the
comp.compilers page.
Search the
comp.compilers archives again.