Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Bactracking/lookahead parser generators? adrian@dcs.rhbnc.ac.uk (1998-10-04) |
| Re: Bactracking/lookahead parser generators? tc@charlie.cns.iit.edu (Thomas W. Christopher) (1998-10-05) |
| Re: Bactracking/lookahead parser generators? jamz@my-dejanews.com (1998-10-05) |
| Re: Bactracking/lookahead parser generators? chip@gen7.net (George W. Freas II \(Chip\)) (1998-10-05) |
| Re: Bactracking/lookahead parser generators? tc@charlie.cns.iit.edu (Thomas W. Christopher) (1998-10-06) |
| Re: Bactracking/lookahead parser generators? bfahle@forelogic.com (Bill Fahle) (1998-10-07) |
| Re: Bactracking/lookahead parser generators? parrt@parr-research.com (Terence Parr) (1998-10-21) |
| From: | "Thomas W. Christopher" <tc@charlie.cns.iit.edu> |
| Newsgroups: | comp.compilers |
| Date: | 5 Oct 1998 20:49:24 -0400 |
| Organization: | Illinois Institute of Technology |
| References: | 98-10-014 |
| Keywords: | parse |
A Johnstone wrote:
> I'd be very grateful for pointers to other parser generators, both
> current and historical that display backtrack or lookahead behaviour.
Another is TCLLk at http://www.toc-press.com/freesoftware.htm
It is an LL(k) parser generator that first attempts to put the grammar
into LL(1) form and then, if that isn't completely successful, builds
look-ahead trees (FSA) using new grammar productions. The
look-ahead trees are supposed to decide which right-hand side to
replace a nonterminal with. Once the correct RHS has been found,
the parser backs up the input resumes parsing.
--
Thomas W. Christopher -- tc@charlie.cns.iit.edu , tc@toc-press.com
Principal, Tools of Computing LLC. -- http://www.toc-press.com
Associate Prof., Illinois Inst. of Tech. -- http://www.iit.edu/~tc
Return to the
comp.compilers page.
Search the
comp.compilers archives again.