Consider a context-free grammar G = ({0, 1}, {S, A, B}, S, P), where P is the set of productions: SAB S- - - OA | 1B | E 1S | OAA OS | 1BB a) Give a leftmost derivation of the string 0011. b) Give a rightmost derivation of the string 0011. c) Draw a parse tree for the string 1001. d) Can the string 1110 be derived from the grammar G? If yes, write down the associated derivation tree. If not, give a justification.

Consider a context-free grammar G = ({0, 1}, {S, A, B}, S, P), where P is the set of productions: SAB S- - - OA | 1B | E 1S | OAA OS | 1BB a) Give a leftmost derivation of the string 0011. b) Give a rightmost derivation of the string 0011. c) Draw a parse tree for the string 1001. d) Can the string 1110 be derived from the grammar G? If yes, write down the associated derivation tree. If not, give a justification.

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

1. The grammar is known as follows:P → H | PbdHH → a | (P)Asked:a. Please make a GOTO (Canonical Set) operation transition diagram
Please solve both parts
Subject : theory of computer science Answer Q. 47 only
. Give the grammar G as S OBI1A, A→ 0IOSI1AA, B→111SIOBB. Give the leftmost and rightmost and derivation trees to derive the string 00110101.
AST(abstract syntax tree) - Semantic computation for expressionE→TE'E'→+TE'│ε T→FT' T'→*FT'│εF→(E)│iDefine an attribute grammar which can construct an abstract syntax tree for an arithmatic expression by SDD.Define an attribute grammar which can compute the value of the expression and give the procedure of sentence 3+4+5.
1
2. Given the grammar below, without any modifications, is it LL(1) in its current form and why yes or no? (Need to compute First() sets and check intersections, separately for each nonterminal). If not LL(1), rewrite as LL(1) and verify it is (do the same all over). S -> abCS | abC | AC A -> bA|bb C -> cC | D D -> dd
3. Let L = {abcm | n,m E N}. Create a context-free grammar for L starting with non-terminal S. 4. b.A: push(E) b,X; push(B) a.A: push(A) a,X; push(A) Consider the given PDA with bottom stack symbol X. It corresponds to a regular language. Create a regular expression for the language accepted by this PDA. A.B: nop A, E; nop c.B:nop q1
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?
24. Show that the grammars and are not equivalent. S→ aSbbSa|SS|a SaSbbSala
24. Show that the grammars and are not equivalent. S → aSb|bSa|SS|a S aSb|bSala
THEORY of Automata. grammar G