Consider the grammar G2: S - E E -E +T E -E T E -T T - id Generate the input string id + id • id using bottom – up parsing approach and construct the derivation tree for the input string. Give the stack implementation of the configurations of the shift- reduce parser for the input string id + id • id according to the expression of the given grammar G2.

Consider the grammar G2: S - E E -E +T E -E T E -T T - id Generate the input string id + id • id using bottom – up parsing approach and construct the derivation tree for the input string. Give the stack implementation of the configurations of the shift- reduce parser for the input string id + id • id according to the expression of the given grammar G2.

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

Given the following grammarE → E + EE → E – EE → idShow that string id + id – id, generates two parse trees.
Context-free grammars (CFGs) and pushdown automata (PDA) Convert the CFG below with terminals {0,1,2}, non-terminals {A,B}, and start symbol A, into a PDA by empty stack. Explain the intuition of why/how this conversion works. A → 0 A 1 | 1 A 0 | B 1 B → ε | 2 B
Hence the grammar: G: ({S, A, B}, {a, b}, S, { S →bbAbabB, A → aA|B| λ , B → bB|A| λ}) Draw the parse tree for string bbaababaa according to the previous grammar:
1)Let G = (V, ∑, R, S) be a grammar with V = {S, H, Gm J}; ∑ = {h, g, j}; and the set of rules: S → H H → h | hJG G → Gg | Sg | HgJ J → jH | HHJ| Jj a)Convert this grammar to a PDA using the method we described. b)Convert G to Chomsky normal form.
A) Write a BNF grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must start with a aa. For example, the strings aaabbabbba, aaaababba, and aababbabb are in the language, while a, bba, ababb, aabaa, and bbaa are not. B) Draw the parse tree for string aabbaaba according to the previous grammar: C) Describe, in complete English sentences and “layman’s terms,” the language defined by the following grammar in BNF (start symbol is <S>):<S> ::= <A>a | b<C> ::= c<A> ::= a<A>a | <C> ::= bb | <C>
a. Write a BNF grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must start with a aa. For example, the strings aaabbabbba, aaaababba, and aababbabb are in the language, while a, bba, ababb, aabaa, and bbaa are not. b. Draw the parse tree for string aabbaaba according to the previous grammar: c. Describe, in complete English sentences and “layman’s terms,” the language defined by the following grammar in BNF (start symbol is <S> ): <S>::= <A>a|b <C>::= c <A>::= a<A>a|<C> ::= bb|<C>
show that the grammar S-aSbS |bSaS|ex is ambignous.
Computer Science Consider the context free grammar (CFG):S -> AB (S being the start symbol)A ->aAb | aabbB -> cBd | cdThe grammar is strong LL(k).a) Determine the value of k.b) As a result of a) above, compute the corresponding look ahead sets (for eachproduction).c) As a result of b) above, write (in C++ pseudo code) the corresponding recursivedescent parser (for the grammar)..
Assumptions ... Alphabet = {a, b} • L1 = { a"b" : n ≥ 0 ^ n mod 3 = 0} L2 = {anbm : n ≥ 0 ^ m ≥ 0 ^ n = m −1} To do in this exercise ... ⚫ Find a context-free grammar G such that L(G) = L1 L2, the concatenation of languages L1 and L2. ⚫ Save your context-free grammar as a JFLAP.jff file, and submit that .jff file to Canvas as your solution to th is exercise.
The parser is used to construct sentences out of words in a natural language by a context-free grammar (CFG) that considers the two subsets known as LL(1) and LR(1) grammars. What is the difference between LL(1) and LR(1) grammars. Find out whether the following grammar is LL(1) or not:
Consider the context-free grammar G = (V, T, S, P), where V = {S, A}, T = {a, b}, and P consists of S → aSb | aAb, A → aA | λ. a. Show the derivation tree resulting from top-down parsing of the string aaaabb. b. Show the leftmost derivation of the string aaaabb.
Let's consider a grammar for expressions is defined as follows.<assign> -> <id> = <expr><id> -> A | B | C | D<expr> -> <id> + <expr> | <id> * <expr> | ( <expr> ) | <id>1. Is this grammar unambiguous? Can you explain in detail?2. How can I design a PDA (PushDown Automata) M that recognizes the BNF (i.e. a metasyntax notation for CFG)?