##
**OAS MCQS** :**CA 3**

**TOPICS INCLUDE :**

**Unit 4**

**1.CONTEXT- FREE LANGUAGES AND SIMPLIFICATION OF CONTEXT-FREE GRAMMAR:**

Ambiguity in Context Free Grammar, Language of a Context Free Grammar, Applications of Context

Free Grammar, Pumping Lemma for Context Free Grammar, Normal Forms for Context Free Grammar

-Chomsky Normal Form, Greibach Normal Form, Context-Free Languages and Derivation Trees,

Leftmost and Rightmost derivations, Sentential forms, Construction of Reduced Grammars,

Elimination of null and unit productions

**Unit 5**

**PUSHDOWN AUTOMATA AND PARSING :**

Representation of Pushdown

Automata, Acceptance by

Pushdown Automata, Pushdown Automata: Deterministic Pushdown Automata and non-deterministic

Pushdown Automata, Context free languages and Pushdown Automata, PARSING: Top-Down and

Bottom-Up Parsing, Description and Model of Pushdown Automata, Pushdown Automata and Context-

Free Languages, Comparison of deterministic and non-deterministic versions, closure properties, LL

(k) Grammars and its Properties, LR(k) Grammars and its Properties

**Link: Csenotes12.in**

## Comments

## Post a Comment