Question 2: Convert the following BNF to EBNF: → = → A | B| C → + | * |( ) |

Answer the following three subquestions with the NFA A and B above: 1. Describe the languages of A and B 2. Form a new NFA C that concatenates L(A) and L(B) 3. Create a DFA that recognizes the NFA C from 2. by using the standard subset construction

Write in the space below the statement of the pumping lemma for context-free languages. Then use it to show that the following language is not context free {ambnam|n>m+1>0} Pumping Lemma Statement:

Considering the following BNF grammar answer the questions.   <s> ::= <a> <b> <a> ::= <a> # <c> | <a> @ <c> | <c> <c> ::= <d> $ <c> | <c> ^ <d> | <d> <b> ::= end | <a> ! <b> <d> ::= just   2a - What is the associativity of the @ operator? Why?.  2b - What is the associativity of the $ operator? Why? In one sentence explain how you determine the answer.  2c – Which one of # and ! operators has a higher precedence? Why? In one sentence explain how you determine the answer. 2d - Which of @ and ^ operators has a higher precedence? Why? In one sentence explain how you determine the answer.

Subject: Compiler Design Please write handwritten Answer

Design a DFA to accept the following language: L = {x | x = {0, 1}*, x contains at least one 0 and at least two 1's}

CS 1105 Chapter 3 Question 7.4 Construct an NFA model that represents the language by the regular expression: x(y ∪ (xy)∗)(x ∪ yy)∗xy

Construct context-free grammar. {a^x b^y | 3x <= 5y <= 4x, x,y > 0}

5. Construct npda that accept the following context-free grammars: (a)     S -> aAB | bBB     A -> aA | bB | b     B -> b   (b)     S -> ABb | a | b     A -> aaA | Ba     B -> bb

Describe in english what this grammar means <S> -> <A> <B> <C>  <A> -> a<A> | a <B> -> b<B> | b <C> -> c<C> | c