Hi all, On Mon, Dec 28, 2009 at 7:44 AM, Adam Megacz <meg...@cs.berkeley.edu> wrote: > Sounds like using GLR to parse a boolean grammar: > > Okhotin, Alexander. __LR Parsing for Boolean Grammars.__ > Developments in Language Theory 2005: 362-373. > > http://www.springerlink.com/content/pm0qjcv1xrch2pjm/
There's a freely accessible version (expanded?) of the paper at: http://users.utu.fi/aleokh/papers/boolean_LR.pdf A. Okhotin, "LR parsing for Boolean grammars", International Journal of Foundations of Computer Science 17:3 (2006), 629--664. Edin _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
