PEG Grammars

With Parsing Expression Grammars (PEG), Bryan Ford simplified traditional parser generators by combining look-ahead lexical analysis with hierarchal parsing in a single generated program. pdf

Much of Ford's thesis discusses using caching to reach computational complexity parity with traditional, non-backtracking, parsing algorithms.

We use the PegLeg Generator because it is so fast.

Curiously PegLeg does not apply Ford's optimization. Rather it achieves its performance by managing its own highly application specific String Space.