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

Related questions

Q: Some of the following grammars may be ambiguous; for each ambiguous gram- mar, show two different…

Q: Consider the grammar; S → aB | bA | D | E A → a | aS | bAA | c B → b | bS | aBB | c D → dD |…

A: Please refer to the following step for the complete solution to the problem above.

Q: The parser is used to construct sentences out of words in a natural language by a context-free…

A: Navigating the landscape of natural language processing, parsers play a pivotal role in transforming…

Q: Use the Bison framework to build a DFA state machine for each of the following grammars. Identify…

A: SOLUTION - PART (a)

Q: Consider the following grammar: = A|B|C + | * | () | Use the grammar above to derive the…

A: **Derivation:**1. Start with the given sentence: A = (B+C) * A2. Apply the production rules of the…

Q: Consider the following grammar G6 from the book: := + | := | = ( cexp> ) lalb|c (a) Draw a…

A: I'm providing the answer to the above question. I hope this will be helpful for you..

Q: Let G = (V, E, R, S) be a grammar with V = {S, H, Gm J}; E = {h, g, j}; and the set of rules: %3D…

A: Overview : Automata Theory is a branch of computer science that deals with designing abstract…

Q: 1. Consider the grammar with productions

A: S --> aABb S --> abBBb (A --> bB) S --> abλBb (B --> λ) S --> abAb (B…

Q: 1 CFGS Consider the following grammar. erpr := erpr + expr | erpr + erpr|(crpr) | number number :=…

A: When working with text, whether authoring or editing, we often need to change something. Name of…

Q: Consider the context free grammar (CFG) with the rules, S is the start variable A and B are…

A: Given : S→ A | B | 0 A → S1 B → S0S1

Q: 23. Show that the grammars and are equivalent. SaSb|ab|A SaaSbblaSb|ab|X

A: We need to prove that S-> aSb|ab|λ and S->aaSbb|aSb|ab|λ are equivalent. Two grammars are…

Q: 2.12 Consider the following grammar: Chapter 2 Programming Language Syntax GS $$ SAM M→ Se A → a Eb…

A: Answer:Introduction:1) From the given grammar G -> S>S -> A MM -> S/€A -> aE/ bAAE…

Q: . Consider the following context-free grammar with start symbol S, nonterminals {S, A, B, C}, and…

A: The question asks to compute the FIRST and FOLLOW sets for each nonterminal in a given context-free…

Q: Consider the following grammar: S→a|b|S+S|S−S (a) Describe in English the strings that are in the…

A: A grammar is a formal way of describing the structure and syntax of a language. It consists of a set…

Q: 10. Let B be the language of all palindromes over {0,1) containing equal numbers of 0s and 1s. Show…

A: Given questions are not interlinked. As per our guidelines, only one question will be answered. So,…

Q: Consider the following grammar (G1) for simple assignment statements. (The symbols that begin with…

A: Assign -> Id := ExprId -> a | b | cExpr -> Expr - Expr | Expr * Expr |…

Concept explainers

Intelligent Machines

Machines that use artificial intelligence to learn from the environment and past experiences to perform better in the presence of variability and uncertainty are called intelligent machines. Intelligence develops according to environment and experience. It is human-like behavior. When the computer system or any programmed machine learns from the inputs and corresponding outputs, it can be called an intelligent machine.

Question

2. Context free grammars, LL parsing
Consider the following grammar:
S→ uBDz
B → Bu
B→ w
D→ EF
E→y
E→
F→ r
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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1 Introduction

VIEW

Step 2 Solution

VIEW

Step 3 Conclusion

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Solve problem 24 please by following the directions.
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
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
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.