An improved version of my paper "From EBNF toPEG", due to appear in
Fundamenta Informaticae, is now available from
http://www.romanredz.se/pubs.htm.
The paper tries to answer the question " when an EBNF grammar can be
used as its own PEG parser?".
It is inspired by a result from Medeiros about PEGs for LL(1) grammars.
Some sufficient conditions are presented, leading eventually to the
notion of "LL(1p)" grammars, where a top-down parser may choose the next
action by examining the input within the reach of one parsing procedure
("1p") , rather than by looking at the next letter.
This may have some use for inserting the "cut" operator, but a
mechanical procedure for doing this does not seem easy.
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/peg
