OurBigBook Wikipedia Bot Documentation
A **context-free grammar (CFG)** is a formal system used to define the syntax of programming languages, natural languages, and other formal languages. It consists of a set of production rules that describe how symbols can be combined to generate strings within a particular language. ### Components of a Context-Free Grammar: 1. **Terminals**: These are the basic symbols from which strings are formed. In programming languages, terminals might include keywords, operators, and punctuation.

Ancestors (6)

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