Revision as of 13:02, 5 February 2024 edit 209.94.142.169 (talk) →Compared to context-free grammars: Add "time" after "quadratic and cubic" ← Previous edit		Revision as of 17:59, 13 May 2024 edit undo 2600:1006:b1a4:8f61:6e8a:2db7:caec:c00e (talk) Fixed typo Tags: Reverted possibly inaccurate edit summary Mobile edit Mobile web edit Next edit →
Line 1: {{short description\|Type of grammar for describing formal languages}} In [[computer science]], a '''parsing expression grammar''' ('''PEG''') ~~is a type of [[formal grammar#Analytic grammars\|analytic]]~~ [[formal grammar]], i.e. it describes a [[formal language]] in terms of a set of rules for recognizing [[string (computer science)\|strings]] in the language. The formalism was introduced by Bryan Ford in 2004<ref name="For04"> {{cite conference \| first = Bryan

Parsing expression grammar: Difference between revisions