There are two restrictions on the type of grammars that can be used with arecursive descent parser. The first is that the grammar cannot have any leftrecursive productions. Give an example of a left recursive production and explainwhy such productions would be a problem.The second restriction is that the grammar must not require more than one tokenlook ahead. Give an example of a production that does not have this property.Explain why this restriction is necessary for recursive descent parsing.Rubrics

Introduction A grammar context-free parser is a type of parser that analyzes a given string of text…

Answered: There are two restrictions on the type…

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

Context-free grammars are sometimes used to model natural languages. In this problem you will model a fragment of the English language using context-free grammars. Consider the following English sentences: The girl is pretty. The girl that the boy likes is pretty. The girl that the boy that the clerk pushed likes is pretty. The girl that the boy that the clerk that the girl knows pushed likes is pretty. This is a special type of sentence built from a subject (The girl), a relative pronoun (that) followed by another sentence, a verb (is) and an adjective (pretty). Give a context-free grammar G that models this special type of sentence. Your terminals should be words or sequences of words like pretty or the girl. Is the language of G regular? If so, write a regular expression for it. If not, prove using the pumping lemma for regular languages. Can you give an example of a sentence that is in G but does not make sense in common English?
For this exercise, we will work on a regular grammar to recognize a comment in a C++ or Java program. A comment starts with /* and ends with */ and anything else in between can be ignored. We won't consider the case of nested comments. Keep in mind that you can have any number of * characters at the beginning, at the end, and in between. • Write a regular grammar recognizing such comments. • Draw the finite state machine for this grammar. • Draw a table for this grammar such as the ones for table-driver scanners in the class notes and in the book.
Reduce the following grammar such that there are no unit productions?
Implement a more extensive finite-state grammar for noun groups by using the examples given in Section 13.5 and test it on some NPs. Use an on-line dictionary with parts-of-speech if available; if not, build a more restricted system by hand.
See the image. a.Construct a context-free grammar generating C.Explain how your construction accounts for each rule. b.We could eliminate one rule from Cand make it regular. Which rule would that be, and why would it work? You do not need a formal proof, but you do need an explanation.
Write a BNF grammar for simple phone numbers e.g. (9)123-4567 (21)987-1234 The number must start with a left parenthesis, followed by 1or 2 digits, followed by a right parenthesis, followed by 3 digits, followed by a hyphen, followed by 4 digits. All digits, including 0, can be used anywhere a digit is required. There must be at least 3 rules in your grammar. The goal non-terminal should be called .
Write a BNF grammar for simple phone numbers e.g. (9)123-4567 (21)987-1234 The number must start with a left parenthesis, followed by 1or 2 digits, followed by a right parenthesis, followed by 3 digits, followed by a hyphen, followed by 4 digits. All digits, including 0, can be used anywhere a digit is required. There must be at least 3 rules in your grammar. The goal non-terminal should be called <phone>.
For the implementation of several compilers, it is important to understand which requirement compilers should satisfy. Explain three requirements that compilers should satisfy. Left-most, right-most and mixed derivations are often used to generate context-free grammars. A context-free grammar G has the production rules: S  aSS S b Generate the word aababbb using left most derivation.
Show that this grammar is ambiguous or not .
Consider the grammar S → aSaS |A It is ambiguous. What is the shortest string in L(S) that can be used to show the grammar is ambiguous? Write the string without any spaces. One way to show the grammar ambiguous is to give two derivations for your string with a particular property. Write the shorter of your derivations here (ie, fewest characters in the derivation): Give another derivation here: Your derivations should begin with S, end with your chosen shortest string from L(S) that shows ambiguity, and only make one substitution per step. Do not include any spaces in your answer. Use the ">" character to represent the right arrow. For example, S>aSb>ab might be a legal derivation for a string in another language.
Define Backus-Naur Form and Context-Free Grammars.Write a sample that does not sleep and analyze it (by analyzing a total of 4 samples.2 pieces (one matching and one not fitting) for BNF and 2 (one matchingthe example that does not fit will be done for the context-free grammer.).
Given the following CFG A → A+B A+ A-B A R R⇒ R/B R→ R*B Rarit B-> (A)|r|t a. Eliminate left recursion and backtracking and write the new grammar.. b. Write the FIRST and FOLLOW sets for A, B, and R.,

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS