Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation, which is closer to how string recognition tends to be done in practice, e.g. by a recursive descent parser.
Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation: the rules of PEGs are ordered. This is closer to how string recognition tends to be done in practice, e.g. by a recursive descent parser.