Re: Semantic actions in LR parser

clark@zk3.dec.com (Chris Clark USSG) writes:
> One curious feature which falls out, is that if you can detect two actions
> are the same you can execute the action even if the eventual reduces are
> parts of two distinct productions. That allows you to defer (and
> eliminate) some conflicts. (In our model, two actions are the same if
> they are character for character the same string.) Eliminating the pseudo
> productions, also means smaller state tables.


Ahh, this sounds like you've rediscovered a result similar to the one in


Brown, C. & Purdom, P. "Semantic Routines and LR(k) Parsers," Acta
Informatica 14 (1980), 299--315.


I suppose 1980 is before the beginning of time for a lot of folks.


I wonder if Chris could compare his results with the Brown-Purdom results.


--Mitch
--
Mitchell Wand
College of Computer Science, Northeastern University
360 Huntington Avenue #161CN, Boston, MA 02115 Phone: (617) 437 2072
Internet: wand@ccs.northeastern.edu Fax: (617) 437 5121
[In 1980 yacc was already eight years old. -John]
--

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