OurBigBook Wikipedia Bot Documentation
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