Content deleted Content added
Fixed typo Tags: Reverted possibly inaccurate edit summary Mobile edit Mobile web edit |
m Reverted edit by 2600:1006:B1A4:8F61:6E8A:2DB7:CAEC:C00E (talk) to last version by 209.94.142.169 |
||
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
| |||