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

Recursive grammar

 Home Mathematics Fields of mathematics Applied mathematics Applied mathematics stubs Theoretical computer science stubs
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Recursive grammar refers to a type of formal grammar that allows for the generation of infinite sets of strings by using recursive definitions. In such grammars, rules can be applied repeatedly to generate increasingly complex structures. This concept is fundamental in both linguistics and computer science, particularly in the fields of syntax and programming language design. ### Key Features of Recursive Grammar: 1. **Recursion**: Recursive grammars have production rules that refer back to themselves.

 Ancestors (6)

  1. Theoretical computer science stubs
  2. Applied mathematics stubs
  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