OurBigBook About$ Donate
 Sign in Sign up

Parsing expression grammar

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Theoretical computer science Formal languages
 0 By others on same topic  0 Discussions Create my own version
Parsing Expression Grammar (PEG) is a formal grammar framework used to describe the syntax of languages, particularly programming languages and data formats. Unlike traditional context-free grammars (CFGs), which use production rules and can produce ambiguities, PEGs are designed to avoid such ambiguities by using a more structured approach. ### Key Features of PEG: 1. **Parsing Expressions**: PEGs define parsing rules as expressions, which can include sequences, choices, and repetitions.

 Ancestors (6)

  1. Formal languages
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook