In computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language. The formalism was introduced by Bryan Ford in 2004 and is closely related to the family of top-down parsing languages introduced in the early 1970s. Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation: the choice operator selects the first match in PEG, while it is ambiguous in CFG. This is closer to how string recognition tends to be done in practice, e.g. by a recursive descent parser.
Unlike CFGs, PEGs cannot be ambiguous; if a string parses, it has exactly one valid parse tree. This makes PEGs well-suited to parsing computer languages, but not natural languages.
Read more about Parsing Expression Grammar: Implementing Parsers From Parsing Expression Grammars, Advantages
Famous quotes containing the words expression and/or grammar:
“Disease is a vital expression of the human organism.”
—Georg Groddeck (18661934)
“I went to a very militantly Republican grammar school and, under its influence, began to revolt against the Establishment, on the simple rule of thumb, highly satisfying to a ten-year-old, that Irish equals good, English equals bad.”
—Bernadette Devlin (b. 1947)