Convert that following grammar to Chomsky Normal Form a. S → Aba A → aab B → Ac

Using the following grammar, show a parse tree and rightmost derivation for A = B * (A + C) A Grammar for Simple Assignment Statements → = → A | B | C → + | * |( )

Starting with the following BNF grammar: [outcome 2.1 /1] :: + | :: * | | ::= ( ) | a | b | c Construct an EBNF grammar from this grammar with the following modifications. Use the EBNF extensions wherever possible to simply the grammars. Include whatever notes to the reader required to make the associativity of the operators clear: a. Add subtraction and division operators (- and/) with the customary precedence and associativity.

QUESTION 1 1. Simplification of Grammars Let us consider the following Context Free Grammar G = ({S, A, B, C, D}, {a,b,d}, S, P) with production rules P S → ASA b A → B|AB|ale B → AC b D→d Simplify, if possible this grammar. More specifically • Remove Null Productions • Remove Unit Productions Remove Unproductive Variables • Remove Unreachable Symbols

Problem #6: Show that the following grammars are ambiguous by demonstrating two different parse trees and two different left-most derivations for the same terminal string in each case. Also for each case, find an equivalent unambiguous grammar: c) S-A B A-aAb ab B-abB c

Construct the SLR parser for the following grammar. | S → BB BCB/D D→ g Check whether the above set of production rules is a SLR parser or not?

Construct a DFA that accepts the language generated by the grammar

Construct an NFA for the following right linear grammar G = ({S,S1, S1, S2, S3), {a,b,c},S, P) where P:

Show if the following grammar is ambiguous or not using Parse tree, left-most derivation and right- most derivation i) expr → expr op exprl (expr)|id| num op → +|-|*|/ ii) S → A A →TIA+T T+b|(A)

Solve number 10