Recursive grammar

In formal language theory, an Recursive grammar is a formal grammar on which one restrictions are made on the left or right sides of the grammar's productions. This is the second most general class of grammars in the Chomsky–Schützenberger hierarchy, and can generate arbitrary recursive languages.

See also

• Turing machine
• Lambda calculus
• String rewriting

References

• Cooper, Keith (2011). Engineering a compiler (2nd ed.). San Francisco: Morgan Kaufmann. pp. 100–101. ISBN 9780080916613. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
• Corballis, Michael (1999). "The Gestural Origins of Language". American Scientist. 87 (2): 138. doi:10.1511/1999.2.138.
• Fitch, W. T. (2004). "Computational Constraints on Syntactic Processing in a Nonhuman Primate". Science. 303 (5656): 377–380. doi:10.1126/science.1089401.
• Fitch, W. T. (2012). "Artificial grammar learning meets formal language theory: an overview". Philosophical Transactions of the Royal Society B: Biological Sciences. 367 (1598): 1933–1955. doi:10.1098/rstb.2012.0103. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
• Kakde, O. G. (207). Theory of Computation. Firewall Media. pp. 98–99. ISBN 9788131801796. {{cite book}}: ISBN / Date incompatibility (help)
• Maurer, P.M. (1990). "Generating test data with enhanced context-free grammars". IEEE Software. 7 (4): 50–55. doi:10.1109/52.56422.</ref>
• Premack, David (2004). "Is Language the Key to Human Intelligence?". Science. 303 (5656): 318–320. doi:10.1126/science.1093993.