More About Converting BNF to PEG

Roman R. Redziejowski · Fundamenta Informaticae · 2014

Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. The parser has many useful properties. Converting PEG to an executable parser is a rather straightforward task. Unfortunately, PEG is not well understood a

Read the paper · More papers on PaperTik