Consider the following grammar: 1. s> E$ 2. E> E+T 3. E→T 4. T> ID 5. T>(E) Suppose you are performing LR(0) parsing and SO is the initial configuration set. SO = { S--> .E$, E .E+T, E --> .T, T --> .ID, T --> .(E) }. Select all the configurations in S2, where S2 = go_to0(SO, "ID" ). O E-->T OT-> ID O E--> T. O T--> ID OT--> ID.

Consider the following grammar: 1. s> E$ 2. E> E+T 3. E→T 4. T> ID 5. T>(E) Suppose you are performing LR(0) parsing and SO is the initial configuration set. SO = { S--> .E$, E .E+T, E --> .T, T --> .ID, T --> .(E) }. Select all the configurations in S2, where S2 = go_to0(SO, "ID" ). O E-->T OT-> ID O E--> T. O T--> ID OT--> ID.

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

C++ Consider the language that the following grammar defines: <S> = c | <W> | c<S> <W> = abb|a<W>bb Write all strings that are in this language and that contain seven or fewer characters. If the answer includes multiple strings, you must enter the answers in alphabetical order. A. In alphabetic order, what are the two strings in this language that are 3 characters in length? B. In alphabetic order, what are the two strings in this language that are 4 characters in length? C. In alphabetic order, what are the two strings in this language that are 5 characters in length?
Transform the following grammar into EBNF: <program> → begin <stmt_list> end <stmt_list> → <stmt> | <stmt> ; <stmt_list> <stmt> → <var> = <expression> <var> → A | B | C <expression> → <var> + <var> | <var> – <var> | <var>
9. It is required to write a parser for the grammar below. <source_file> ::= <declarations> <code> <declarations> ::= vars <list_of_variables> ; <list_of_variables> ::= <variable> | <list_of_variables> , <variable> <code> ::= <statements> . <statements> ::= <assignment> | <statements> ; <assignment> <assignment> ::= <variable> := <expression> <expression> ::= <expression> + <term> | <expression> - <term> | <term> <term> ::= <term> * <factor> | <term> / <factor> | <factor> <factor> ::= <number> | <variable>
L ::= S ; L L ::= S S ::= print E E ::= id E ::= num Assume that that an implementation of the LR(0) table above always resolves a shift/reduce conflict by shifting rather than reducing. Will this implementation correctly parse strings accepted by the grammar? Explain.
Consider the following grammar: X -> (Y) | b Y -> Y, X | X List LR(0) items for this grammar
FIRST set for CFG/grammar in C/C++. input is grammar , output is shown the first set. example input grammer : E -> TR R -> +T R| # T -> F Y Y -> *F Y | # F -> (E) | i Output :First(E)= { (, i, }First(R)= { +, #, }First(T)= { (, i, }First(Y)= { *, #, }First(F)= { (, i, } Assumptions : Epsilon is represented by ‘#’. Productions are of the form A=B, where ‘A’ is a single Non-Terminal and ‘B’ can be any combination of Terminals and Non- Terminals. L.H.S. of the first production rule is the start symbol. Grammar is not left recursive. Each production of a non-terminal is entered on a different line. Only Upper Case letters are Non-Terminals and everything else is a terminal. Do not use ‘!’ or ‘$’ as they are reserved for special purposes.
Q1: Compute the weakest precondition for each of the following assignment statements and postconditions: a) a=2* (b - 1) -1 {a > 0} b) b=(c+10)/3 {b>6} c) a=a+2*b-1 {a > 1} d) x=2* y+ x -1 {x > 11} Q2: Using the grammar, show a parse tree and a leftmost derivation for each of the following statements: → → A| BI C → + | |( ) 1. a. A = A * (B + (C * A)) b. B C* (A * C+ B) с. А - А * (В + (C))
Rewrite the following EBNF grammar in BNF. <decl> → <ident_list> : (int | float | char); <ident_list> → <identifier>{,<identifier}.
Consider the following grammar: S➞ ACB/CbB/BaA➞ da/BCB➞ g/∈C➞ h/∈ What is the follow of B?
Write a program to compute FIRST for the following grammar? S --> aAB A --> b B--> d
arrow_forward Step 1 Context Free Grammar: A formal language that is used to generate all possible strings in a given formal language is called context free grammar. It can be defined as: G=(V, T, P, S) Where G specifies the grammar V specifies the finite set of non-terminal symbols. T specifies the finite set of terminal symbols. P specifies the set of production rules. S specifies the start symbol. The start symbol S is used to derive a string in a context free grammar. It is derived by repeatedly replacing a non-terminal symbol by the right-hand-side production until all the non-terminal symbols have been replaced by the terminal symbols. arrow_forward Step 2 G is a context-free grammar for a language L, and L contains only strings of length 2 or greater. We have to prove that there is a context-free grammar Gd which generates L such that every rule in Gd has the form A -> x1x2, where A is a terminal and each xi is a terminal or a non-terminal. Let the alphabet of…
Let E = {a, b, c}. Write a grammar that generates the language: L = {c"ww* a":n > 0, m > 0, w e E+} HTML EditorÉ B I UA A 工E 三三 x x, : You Tube T T 12pt Paragraph G= ( {S,A}, {a,b,c}, S, P) P: S-> cSalcAa A->aAa|cAc 18 words