Consider the following grammar: GS $$ SAM M ->> SE A a Eb A A ->> E a Bb Ale B - b E | a B B (a) Describe in English the language that the grammar generates. (b) Show a parse tree for the string a b a a. (c) Is the grammar LL(1)? If so, show the parse table; if not, identify a prediction conflict. d) Formally define the grammar as a 4-tuple G=

Consider the following grammar: GS $$ SAM M ->> SE A a Eb A A ->> E a Bb Ale B - b E | a B B (a) Describe in English the language that the grammar generates. (b) Show a parse tree for the string a b a a. (c) Is the grammar LL(1)? If so, show the parse table; if not, identify a prediction conflict. d) Formally define the grammar as a 4-tuple G=

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

Consider the following grammar: X -> (Y) | b Y -> Y, X | X List LR(0) items for this grammar
Consider the following CFG with alphabet {a, b} and start variable S: S- AB A- aAa B- ÞBb a. What is the shortest string in the language of the grammar excluding the empty string? b. Draw the derivation tree for the string in (a). c. Explain whether this grammar is ambiguous or not? d. Describe in English the language generated by the grammar. e. Explain why this CFG can or cannot generate a regular language.
Consider the following Grammar:A-> ABd|Aa|aB-> Be|bRemove left recursion.
The language L = { ambncm+n: m, n > 0 } can be generated by which type of grammar? A. A regular grammar B. A context-free grammar but not by any regular grammar C. A grammar in Chomsky normal form but not by any grammar in Greibach normal form D. A context-sensitive grammar but not by any context-free grammar
The analyzer syntactic is required for the following grammar: File = file (line | epsilon) L ine = (ID (parameter_list | epsilon) | epsilon) NL Parameter_list = param (, parameter_list | epsilon) Param = (ID | F) (param | epsilon)
Consider the grammar S> as | aSbS | ɛ This is an ambiguous grammar. Show in particular that the string aab has two: a) parse trees b) left most derivation c) right most derivation
Consider the following grammar G: The grammar is not suitable for a top-down predictive parser. Identify the problem and correct it by rewriting the grammar as an LL(1) grammar for the same language
2. Using the grammar E-> E+T E-> T T-> id T-> number T-> (E) a. Give a derivation and draw a parse tree for a + b + (c+d). Derivation: F can women w
Let G = (V, E, R, S) be a context-free grammar. Then S SS can be used to generate L(G). %3D Select one: True False
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)..
Q 2 - Give bottom up parser LR(0) and SLR(1) for the following input strings and grammars a. The input string is 000111 and the grammar is S-> 0 S 1 | 0 1 b. The input string is aaa*a++ and the grammar is S -> SS+|SS * | a
boolval denotes the token for Boolean literal (e.g., true, false). A denotes the Boolean AND operator, and O denotes the Boolean OR operator. You are given the following BNF grammar: → boolval | A | 0 (a) Draw the parse tree of this expression: A true O 0 false true A true false (b)According to the token(s) and the grammar rule(s) mentioned in the beginning of Question 2, write a grammar file that can be used in SableCC.