> Also, if (like in PEG), the grammar does not support "empty" rules, you > can > make the A' non-terminals in the A rule optional. This has the same > effect.
PEGs do support empty rules - take a look at the inductive definition of PEGs in Bryan Ford's POPL'04 paper, at http://pdos.csail.mit.edu/~baford/packrat/popl04/peg-popl04.pdf Cheers, Alex I'm not sure what you're trying to accomplish, but if you're just facing > practical problems, this algorithm should be of some help... > > Cheers, > > Hans > > > On Thursday 20 September 2007, Claudio Campos wrote: > > VPRI Folks, > > > > Are there any version or update of OMeta (Meta for Squeak) that support > > left recursion (as describe in paper: "pakrat parser can support left > > recursion" with memoization table) > > > > Thanks, > > > > Claudio Campos > > Santa Fe, Argentina > > > > > > _______________________________________________ > > fonc mailing list > > [email protected] > > http://vpri.org/mailman/listinfo/fonc > > > > -- > If we cannot live so as to be happy, let us at least live so as to deserve > it > -- Immanuel Hermann Fichte > > A liberal is a person whose interests aren't at stake at the moment > -- Willis Player > > Ark Linux - Linux for the Masses (http://arklinux.org) > > Hans Schippers > Aspirant FWO - Vlaanderen > Formal Techniques in Software Engineering (FoTS) > University of Antwerp > Middelheimlaan 1 > 2020 Antwerpen - Belgium > Phone: +32 3 265 38 71 > Fax: +32 3 265 37 77 > > _______________________________________________ > fonc mailing list > [email protected] > http://vpri.org/mailman/listinfo/fonc >
_______________________________________________ fonc mailing list [email protected] http://vpri.org/mailman/listinfo/fonc
