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:
“No man’s thoughts are new, but the style of their expression is the never-failing novelty which cheers and refreshes men. If we were to answer the question, whether the mass of men, as we know them, talk as the standard authors and reviewers write, or rather as this man writes, we should say that he alone begins to write their language at all.”
—Henry David Thoreau (1817–1862)
“Grammar is the logic of speech, even as logic is the grammar of reason.”
—Richard Chenevix Trench (1807–1886)