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

Greibach normal form

 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
Greibach Normal Form (GNF) is a specific way of representing context-free grammars in formal language theory. In GNF, each production rule of the grammar has a particular structure that facilitates certain types of parsing. Specifically, a context-free grammar is in Greibach Normal Form if all of its production rules satisfy the following conditions: 1. The left-hand side of each production must consist of a single non-terminal symbol.

 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