Next: About this document
cse4083/5083 Formal Languages
Study Topics for Exam 1 (Spring, 1999).
- Sets, relations and functions.
- Recursive Definitions.
- Countability and Uncountability of sets.
- Mathematical Induction.
- Regular Expressions and Languages.
- Context free grammars and Derivations.
- Given a grammar G, define L(G) in either set form or regular
expression form.
- Given a description of a language L, produce a context free grammar G
such that L=L(G).
- Normalization; in particular
- removing recursive start symbol
- removing
productions - removing useless symbols
- removing chain rules
- removing left recursive productions
- given a grammar, produce an equivalent one in Chomsky Normal Form
Robert Morris
Fri Feb 14 11:06:20 EST 1997