Consider the following grammar G = {S, A}, S = {S}, ∑ = {a, b},          P : S → aS | aA; A → bA | b; Which of the following regular expression denotes L(G)?

A) Write a BNF grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must start with a aa. For example, the strings aaabbabbba, aaaababba, and aababbabb are in the language, while a, bba, ababb, aabaa, and bbaa are not. B) Draw the parse tree for string aabbaaba according to the previous grammar: C) Describe, in complete English sentences and “layman’s terms,” the language defined by the following grammar in BNF (start symbol is <S>):<S> ::= <A>a | <B>b<C> ::= c<A> ::= a<A>a | <C><B> ::= b<B>b | <C>

Subject: Compiler Design Consider the following grammar and input string, S → S+S S → S*S S → (S) S → a Input string: a1*(a2+a3) Find out the parsing table using shift reduce parsing.

remove left recursion from the following grammar:

Let L = { w ∈ { a, b, c }* | w contains exactly one b or starts with ac }.a) Construct an NFA that recognizes L.b) Construct an NFA that accepts any positive number of occurrences of various strings (not empty string)from this language concatenated together.

(b) What language is generated by the following grammars? In each case justify your answer.i. S -> 0 S 1 | 0 1ii. S ->+ S S | - S S | aiii. S ->S ( S ) S | Ɛiv. S ->a S b S j b S a S | Ɛv. S -> a | S + S | S S | S * | ( S )

Write a grammar for the language consisting of strings built only of theletters aand b. The strings may have any number of these letters, but the letter combinationsbabmust be in each stringsomewhere, and each stringmust startwithabb. For example, the strings bbababbbaa, bbbaaaababaa, and bbbabare in the language, whilea, aabb, baaa, and bbba are not.

Please help 8. The known Grammar as follows: S à AX X à or AX | ️(epsilon) A à CY Y à and CY | ️(epsilon) C à not C | (S) | 0 | 1 Question C. Please do a stack implementation for strings: (0 or 1) and 1

c++ question

fill out those two table?