chap5
Computer Language Theory
1 Computer Language Theory Chapter 2: Context-Free Languages.
1 Context-Free Languages Not all languages are regular. L 1 = {a n b n | n 0} is not regular. L 2 = {(), (()), ((())),...} is not regular. some properties.
Context-Free Languages
