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.
PEGs also look similar to context-free grammars (CFGs). This is syntactically. They have a different interpretation. A different interpretation is closer to how string recognition tends to be done in practice by a recursive descent parser. Practice is e.g..