HomeworkLib
Question

Consider the following grammar G1 S →E E →E or E | E and E |...

Consider the following grammar G1

S →E

E →E or E | E and E | not E

E → true | false

Show that G1 is ambiguous

Modify G1 such that G1 is not ambiguous and the order of precedence, from highest to lowest, of logical operators is: not, and, or.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
Consider the following grammar G1 S →E E →E or E | E and E |...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 1. Start with the grammar G6 from your textbook, repeated here: Please modify the grammar G6...

    1. Start with the grammar G6 from your textbook, repeated here: Please modify the grammar G6 in the following ways: Add subtraction and division operators(-and /) with the customary precedence and associativitv ·Then add a left-associative operator % between + and in precedence. . Then add a right-associative operator at lower precedence than any of the other oper ators. Please note that you need not show the intermediate grammars produced as a result of each modification specified above; just provide...

  • 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)...

  • Solve the following questions. All questions are mandatory. Q1: What’s wrong in the following grammar? S...

    Solve the following questions. All questions are mandatory. Q1: What’s wrong in the following grammar? S → ABC A → aA|aa B → bB|B C → cC|cccc Q2: Describe the strings generated by the following grammar S → aSa S → bSb S → aa S → bb Q3: Consider the following grammar: S → ABC A → aA|a B → bB|b C → cC|c Change the above grammar such that it generates L1={anbmck; n>=3,m>=3,k>=4} Q4: Use the following grammar...

  • Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where...

    Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where T={a,b} V={S }. a. Show that the grammar is ambiguous. b. What is the language generated by this grammar? 2. (20 points) Consider a grammar: S -->a | aS | SS | Ssb | Sbs, Where T={a,b} V={S}. a. Show that the grammar is ambiguous. b. What is the language generated by this grammar?

  • 1. Write a BNF description of the logical expressions and the relational expressions in C++. Make...

    1. Write a BNF description of the logical expressions and the relational expressions in C++. Make sure that the BNF reflects the order of precedence of the operators, as well as, the associativity rules. 2. Using the BNF rules in 1., give a rightmost derivation and show a parse tree for the expression below. 3. Prove that the following grammar is ambiguous and rewrite the grammar to remove ambiguity «newexp> → «newexp> @ <newexp> ulvl w I <other> <other> →

  • 1.)    Consider the following grammar in which S, A, and B are nonterminal symbols and S...

    1.)    Consider the following grammar in which S, A, and B are nonterminal symbols and S is the start symbol. S → 1A | 0B A → A0 | 1B B → 10A| 1 Show that the grammar is ambiguous by showing two parse trees for the sentence 1110110 using leftmost derivation.

  • Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where...

    Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where T={a,b} V={S }. a. Show that the grammar is ambiguous. b. What is the language generated by this grammar?

  • Consider a grammar: S --> | aS | SS SSb | Sbs, Where T={a,b} V={S }....

    Consider a grammar: S --> | aS | SS SSb | Sbs, Where T={a,b} V={S }. Show that the grammar is ambiguous. What is the language generated by this grammar?

  • 10 pt) Consider the following grammar where S is the start variable » terminals: x, y,...

    10 pt) Consider the following grammar where S is the start variable » terminals: x, y, z,t,,* non-terminals: El T, F, V * start symbol: E production rules (a) (4 pt) What is the associativity of the operators+,, * and/ explain why. (b) (3 pt) What is the precedence of , and / explain why (c) (3 pt) Given a parse tree F * T 2 2 Explain how the value of the string is generated

  • Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the...

    Question Set 2 1. Given the following grammar dactor>-> ( <expr> ) a) What is the associativity of each of the operators? What is precedence of the operators? Show a leftmost derivation and parse tree for the following sentence: b) c) A-A(B(C A)) d) Rewrite the BNF grammar above to give precedence over and force to be right associative.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT