2. Context free grammars, LL parsing Consider the following grammar: S→ uBDz B → Bu B→w D→ EF E→y E- F→I F→ a. Calculate Nullable, FIRST, and FOLLOW for this grammar. b. Construct the LL(1) parsing table and give evidence that this grammar is not LL(1). c. Modify the grammar as little as possible to make an LL(1) grammar that accepts the same language.

2. Context free grammars, LL parsing Consider the following grammar: S→ uBDz B → Bu B→w D→ EF E→y E- F→I F→ a. Calculate Nullable, FIRST, and FOLLOW for this grammar. b. Construct the LL(1) parsing table and give evidence that this grammar is not LL(1). c. Modify the grammar as little as possible to make an LL(1) grammar that accepts the same language.

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

Please answer this question fast
→ E. Derive abbbaabba from the grammar Consider the following grammar: S- abB, A - aaBb, B rules. Show each step. How many strings can this grammar generate? Draw a syntax tree for your derivation. bbAa, A
Solve problem 24 please by following the directions.
a) Consider the grammar; SaB | bA | D | E a | aS | bAA | c b | bS | aBB | c dD | Dd | d EDE EE SABDE - - 1) Check whether the given grammar is ambiguous or not by draw different parse trees for same test string. If ambiguity found, make this grammar unambiguous.
Design the CFG rules for (a+b)*aa(a+b)* consider following S→ aSa| aBa B→ bB|b use the set notation to define the language generated by the grammar? what is the shortest string that can be produced from the grammar? Write another possible string that can be generated from the language?
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?
Use the bison framework to build a DFA state machine for each of the following grammars. Identify any possible conflicts causing the bottom-up parsing to fail. Make sure to complete the missing closures in each state. 1) expr expr '+' term | expr'-' term | term term – term ** primary | primary primary → ID | (' expr ')' |'-' primary 2) expr → expr '+' term | term term - term * primary | primary primary - ID | '(' expr ')' expr '+' term | expr'-' term | term term *" primary| primary primary → ID | '(' expr ')' | '' primary | ID '(' expr ')' 3) expr term
Answer with explaination
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
Question 1 Consider the following grammar S aSb S Sb LI Give a one-sentence description of the language generated by this grammar. 1.2 Show that this grammar is ambiguous by giving a single string that can be parsed in two different ways. Draw both parse trees. 13 Give an unambiguous grammar that accepts the same language as the grammar above.
Given the following EBNF grammar: A -> [B, C,] D B-> '(, E, F, '), E C-> ', G D->-, G E -> " " F-> "o", "D", G-> "I" Give an example sentence that is within the grammar. NB: you can ignore whitespace.
NAT Lang processing: Please explain in detail Consider a CFG representing a phrase structure grammar for a natural language such as English, including the following rule (the period is part of the rule): S -> NP VP . In this rule, S, NP, and VP are non-terminal symbols, but we will assume that the period is a terminal symbol specifically representing a period (as opposed to some other end-of-sentence marker). So, we can interpret this rule as stating that a sentence can have the form of a noun phrase followed by a verb phrase followed by a period. (To implement a parser for grammars with rules like this, the tokenizer would have to treat periods as separate tokens.) Assume that you need to convert this grammar to Chomsky normal form (CNF), perhaps with the CKY parsing algorithm in mind. Using the procedure discussed in class, show the rules that might result from the conversion.