Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Theory of Computation Lecture 7: Context-free Grammar

Summary: Theory of Computation
Lecture 7: Context-free Grammar
Max Alekseyev
University of South Carolina
February 2, 2012
Lecture Outline
Context-free Grammars
Context-free Languages
Parse Trees and Ambiguity
Chomsky Normal Form
Languages with Recursive Structure
Consider a language L = {0n1n | n 0}. As we already know, this
language is not regular.
However, it can be generated by simple recursive rules:
for a string s from L, the string 0s1 is also in L.
That is, applying these rules and starting with L, we will get
that the strings 01, 0011, 000111 and so on are also in L. Sooner
or later we will obtain every element of L.


Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina


Collections: Biotechnology; Computer Technologies and Information Sciences