QUESTION 2: Consider the following grammar (the start symbol is X; the alphabets are implicit in the rules): to answer the following: X- BX | € B - B1 | OB1 | 01 A. Give a right-most derivation for the terminal string: 010101. B. Give a left-most derivation for the terminal string: 010101. C. Show that the grammar is ambiguous by exhibiting two distinct derivation trees for some terminal string example 0011l.

QUESTION 2: Consider the following grammar (the start symbol is X; the alphabets are implicit in the rules): to answer the following: X- BX | € B - B1 | OB1 | 01 A. Give a right-most derivation for the terminal string: 010101. B. Give a left-most derivation for the terminal string: 010101. C. Show that the grammar is ambiguous by exhibiting two distinct derivation trees for some terminal string example 0011l.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Design a context-free grammar for an alphabet, E = {a,b,c,d} that generates the language, L={a*b°c"d" | n 21, m 21} u {a"b"c"d°|n 21, m 21} Show that the grammar you designed is ambiguous by giving two different parse trees for some string in the language.
Consider the grammar below. -> | ; -> = -> + | - | -> | const -> a | b| c|d In the rightmost derivation of "a=const ; b=a", what is the 7th sentential form? (the first one is ) Select one: a. = ; a = b b. = ;b = a C.; = d.; = a e. ; b = a
QUESTION 4. rules: 1. 2. Let G= ({S}, {(,)), P, S) be a CFG, where P contains the following S→SSI(S)Se List three different strings in L(G). What is the language L(G)? (You may either give its name or characterize the strings in it.) 3. Show that the grammar G is ambiguous by constructing two different parse trees for some member of L(G). Can you revise the grammar G to make it unambiguous?
Q2 Establish that L is context-free by building a CF grammar for L = {0"1™ : n # 5m and n, m > 0}.
Computer Science Consider the following two grammars with alphabet a and b i. (b*ab*a)*b* ii. (b*ab*a)*b*(b*ab*a)*b* Are there any strings are generated by one of the grammars and cannot be generated by the other? If there are more than one such string, how do you describe them.
Is the grammar LL(1)? Why or why not? If grammar is LL(1), use your parsing table to derive the string: modifier noun verb modifier
Upvote is guaranteed for correct and detailed answer. Thank you!
Question 2-Context-free Grammars Consider the alphabet = {A, V., (,), x, y, z) and the following grammar G = (V,E, R, F), defined by the rules: F (FAF) | (FVF) | (F) | P (a) Identify the set of variables and the set of terminal symbols of G. (b) Identify three words (of lengths between 10 and 20) that can be generated by the above grammar and show their derivations. (c) Consider a modified grammar G', where we remove the brackets '(' and ')' from the alphabet and the derivation rules. That is we set Σ'= {A, V., x, y, z) and we remove all occurrences of brackets in the derivation rules. Show that there are words that are derived ambiguously in G'
What is the equivalent regular grammar for the following context free grammar?. S→AB; A→aa; B→ aB | bB | A; O A. SaS | bs | A; A→ aB; OB. O C. O D. SaA; A→ aA | bA | a; B-a S-aA; A→ aB; B→ aB | bB | A; S-as | bs | aA; A→ aB; B→ aB | bB | λ;
Both
Detailed answer please. Thank you
5. How to convert a Regular Expression to left-linear grammar (0+1)*00(0+1)* 6. Define regular expression and regular set. Find an equivalent regular expression to the following DFA- qo