OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Context-free grammar

 Home Mathematics Fields of mathematics Applied mathematics Theoretical computer science Formal languages
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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

 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