|Information for Tomita and Early algorithms firstname.lastname@example.org (Unmesh joshi) (2004-01-09)|
|Re: Information for Tomita and Early algorithms email@example.com (Ivan Boldyrev) (2004-01-12)|
|Re: Information for Tomita and Early algorithms firstname.lastname@example.org (Oliver Zeigermann) (2004-01-12)|
|Re: Information for Tomita and Early algorithms email@example.com (2004-01-12)|
|Re: Information for Tomita and Early algorithms firstname.lastname@example.org (2004-01-16)|
|Date:||16 Jan 2004 22:38:13 -0500|
|Posted-Date:||16 Jan 2004 22:38:13 EST|
I have an open source Tomita parser:
"The DParser is a scannerless GLR parser generator based on the Tomita
algorithm. It is self-hosted and very easy to use. Grammars are
written in a natural style of EBNF and regular expressions and support
both speculative and final actions."
I also found:
"Tomita-Style Generalised LR Parsers", by Elizabeth Scott,
Adrian Johnstone, and Shamsa Sadaf Hussain.
to be very useful. There is one issue related to handling
right epsilon grammars which I did not find a reasonable
solution to in the literature. I have implemented my
own solution based on adding hints to the state table.
If you would like more information regarding implementation
issues, please feel free to contact me: jplevyak at acm (org).
Return to the
Search the comp.compilers archives again.