From EBNF to PEG
Roman R. Redziejowski · Fundamenta Informaticae · 2013
Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. The parser has many useful properties, and with the use of memoization, it works in a linear time. In its appearance, PEG is almost identical to a grammar