For the grammar <A> ::= <A><A> '+' | <A><A> '*' | 'a' and the string aa...
For the grammar <A> ::= <A><A> '+' | <A><A> '*' | 'a' and the string aa + a*
Give the leftmost derivation
Give the rightmost derivation
Give a parse tree
Is the grammar ambiguous or unambiguous? (Justify your answer)
Describe the language generated by this grammar
Homework Answers
Add Answer to:
For the grammar <A> ::= <A><A> '+' |
<A><A> '*' | 'a' and the string aa...
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous...
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous (b) Find an equivalent unambiguous context-free grammar. (c) Give the unique leftmost derivation and derivation tree for the string s generated from the unambiguous grammar above. 2. Construct non-deterministic pushdown automata to accept the following language (20) 3. Convert the following CFG into an cquivalent CFG in Chomsky Normal Form (CNF) (20)-
For both of the following languages, provide a grammar that generates it, an intuitive explanatio...
Please actually answer it
For both of the following languages, provide a grammar that generates it, an intuitive explanation why this grammar generates this language, and a graphical representation of a push-down automaton that recognizes this language. (a) The language of properly nested sets of parentheses over the alphabet G)). Note that the string (COO))) belongs to this language, while the string (O) () does not because the third closing parenthesis does not have a matching opening parenthesis. Provide a...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
Consider the following grammar (G1) for simple assignment statements. (The symbols in double quotation marks are...
Consider the following grammar (G1) for simple assignment statements. (The symbols in double quotation marks are terminal symbols.) assign → id “ = ” expr id → “A” | “B” | “C” expr → expr “ + ” expr | expr “ ∗ ” expr | “(” expr “)” | id a) Give a (leftmost) derivation for string A = B ∗ A + C. b) Give the parse tree for string A = B ∗ A + C. c)...
4. (5 points) Is the following grammar ambiguous? Justify your answer (give a string and derive...
4. (5 points) Is the following grammar ambiguous? Justify your answer (give a string and derive it with two leftmost derivations using G). If it is ambiguous, rewrite this grammar to an unambiguous one (hint: recall "dangling else" as we discussed in the class)
1) a. Write down an unambiguous grammar that generates the set of strings {...
1) a. Write down an unambiguous grammar that generates the set of strings { s;, s;s, s;s;s;, . . . } b. Give a leftmost and rightmost derivation for the string s;s; using your grammar.
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the...
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...
3. Using the grammar below, show a parse tree and a leftmost derivation for the statement....
3. Using the grammar below, show a parse tree and a leftmost derivation for the statement. A = ( A + (B)) * C assign <idxpr expr>? <expr> <term> term <term factor factor (<expr>) l <term I <factor l <id> 4. Prove that the following grammar is ambiguous (Give sentence that has two parse trees, and show the parse trees):
To verify that a string of characters belongs to a language defined by a grammar, we...
To verify that a string of characters belongs to a language defined by a grammar, we must create a parse tree that shows that the string can be generated by the grammar. Consider the following grammar: <list> -> <item> , <list> | <item> <item> -> <left> <item> <right> | <left> <right> <left> -> A| B | C <right> -> x | y | z Choose a string that is in this language and create a parse tree that demonstrates that...
1. Given grammar: E -> E*E | E + E | num and input string num...
1. Given grammar: E -> E*E | E + E | num and input string num + num *num. 1a.Write 2 possible leftmost derivations from E to the input string. 1b.Draw parse tree for the two leftmost derivation that you wrote above.
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous (b) Find an equivalent unambiguous context-free grammar. (c) Give the unique leftmost derivation and derivation tree for the string s generated from the unambiguous grammar above. 2. Construct non-deterministic pushdown automata to accept the following language (20) 3. Convert the following CFG into an cquivalent CFG in Chomsky Normal Form (CNF) (20)-
Please actually answer it
For both of the following languages, provide a grammar that generates it, an intuitive explanation why this grammar generates this language, and a graphical representation of a push-down automaton that recognizes this language. (a) The language of properly nested sets of parentheses over the alphabet G)). Note that the string (COO))) belongs to this language, while the string (O) () does not because the third closing parenthesis does not have a matching opening parenthesis. Provide a...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
4. (5 points) Is the following grammar ambiguous? Justify your answer (give a string and derive it with two leftmost derivations using G). If it is ambiguous, rewrite this grammar to an unambiguous one (hint: recall "dangling else" as we discussed in the class)
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...
3. Using the grammar below, show a parse tree and a leftmost derivation for the statement. A = ( A + (B)) * C assign <idxpr expr>? <expr> <term> term <term factor factor (<expr>) l <term I <factor l <id> 4. Prove that the following grammar is ambiguous (Give sentence that has two parse trees, and show the parse trees):
Most questions answered within 3 hours.
-
What is the purpose of the 2' hydroxyl group in RNA? What is
the reason this...
asked 1 minute ago -
You currently have 20,000X ethidium bromide. You want to make
250 mL of 1X ethidium bromide...
asked 14 minutes ago -
What mass of lead is needed to absorb 348 J of heat if the temp
of...
asked 17 minutes ago -
Explain the difference between an auction with reserve
and an auction without reserve. if not specified,...
asked 19 minutes ago -
Write the net ionic equation for the precipitation reaction that
occurs when aqueous solutions of aluminum...
asked 22 minutes ago -
How do we find the slope distance, given the horizontal distance
and the zenith angle?
For...
asked 21 minutes ago -
The table to the right lists probabilities for the corresponding
numbers of girls in three births....
asked 32 minutes ago -
The inverse demand function for good X is P = 5−0.05Q. The
firm’s cost curve is...
asked 30 minutes ago -
The Fresh Connection is really pushing the new line of juice
products. Given that it takes...
asked 36 minutes ago -
An acute decrease in mean arterial pressure (by getting up very
quickly, for instance) will cause...
asked 35 minutes ago -
Is the pH of solutions important when using the Fluoride ISE? If
so, why?
asked 38 minutes ago -
Producer surplus is:
a.
always equal to consumer surplus.
b.
the amount paid to sellers above...
asked 40 minutes ago