Exercise 4:Consider the following CFG grammar:aABeSA→B-Abc | bdwhere 'a', 'b', 'c' and 'd' are terminals, and 'S' (start symbol), 'A' and 'B' are non-terminals.a) Parse the sentence "abbcde" using right-most derivations.b) Parse the sentence "abbcde" using left-most derivations.c) Draw the parse tree.

A derivation tree represents the process of deriving a string from the start symbol by applying the…

Answered: Exercise 4: Consider the following CFG…

Exercise 4: Consider the following CFG grammar: SaABe Abc b A→ B-d where 'a', 'b', 'c' and 'd' are terminals, and 'S' (start symbol), 'A' and 'B' are non-terminals.

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

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.
Consider the following context-free grammar. S→aBa∣B B→bbC∣cc∣ε C→cC∣bBcCb∣ε Notice that the start variable is not on the right hand side of any replacement rule. This question addresses how the grammar will be changed when applying the second step of converting it to Chomsky normal form -- namely, removing ε-rules. Which of the following rules would be added to the grammar when the ε-rules are removed? Select all that apply. Question 2 options: S→ε S→bb B→bb C→c C→bcb
d) Construct a type-3 grammar that derives the L₂ language. (You can use the A- intransitive diagram you found in b.) 5. Let the G, grammar be defined as follows: QILIAH Блязадоля до УТИБАЯ TO G₁VN,VT.P.S> UDAL VN: (S, A, B, CADA ESOSESOE VT: (0,1) P: SOS | 1A A OBAM B➡ OB | 15 | 1 H odmuinsbur2. a) What type of grammar is G₁? b) Construct the FA (finite automaton) model that recognizes the language derived from this grammar and draw the transition diagram.. HOITUD
Topic: Compiler Construction Syntax Analysis Show that the grammarA → −AA → A − idA → idis ambiguous by finding a string that has two different syntax trees.Now make two different unambiguous grammars for the same language:a) One where prefix minus binds stronger than infix minus.b) One where infix minus binds stronger than prefix minus.Show the syntax trees using the new grammars for the string you used to prove theoriginal grammar ambiguous.
1. Use the algorithm described in class that takes a CFG and converts it into a CNF (Chomsky Normal Form) grammar that generates the same language as the original grammar, except possibly for the string A, to answer the following question. As part of your answer, you should say which variables are nullable, and you should give the appropriate grammar after each step of the algorithm. There are four steps. Give a CFG (context-free grammar) in CNF (Chomsky Normal Form) that generates the same language, except possibly for the string A, as the following grammar: SAB AB →bAa A → aaB bb
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)..
G(E):E->E + T | T T->T*F | FF->(E) | digitConstruct a parser for grammar E by YACC-BISON, compute the value,and print the result.Design the attribute grammar: + and * operator can only be used for integers,else errors should be reported. code should be submitted as well. Please add explanation. PLEASE DONT COPY AND PASTE THE OTHER SOLUTION ON CHEGG BECAUSE IT ISNT THE FULL ANSWER
Topic: Parsing Problem 2. Consider the following context-free grammar What is the language L described by the grammar? Compute the first sets for S, X, and Y. You must show the iterations of the algorithm separately Compute the follow sets for S, X, and Y. You must show the iterations of the algorithm separately Construct the LL(1) parsing table for the grammar. It is enough to just show the table Show the steps in parsing the strings from L
1. Consider the following context-free grammar with start symbol S, nonterminals {S, A, B, C}, and terminals {0,1}: SAO A→B A → C1 B→ 1 B→ E C→ 0 (a) Compute all the sets FIRST and FOLLOW necessary to implement a recursive decent parser for this grammar. However, do not list any unnecessary such a set. (b) Investigate all the combinations of sets FIRST and FOLLOW that are involved in the im- plementation of a recursive descent parser for this grammar. Explain how these com- bination make the grammar suitable or unsuitable (as the case might be) for recursive descent parsing.
7. a. Write a BNF grammar for identifiers that consist of an arbitrarily long string of letters and digits, the first one of which must be a letter. b. Using your grammar from Exercise 7a, show a parse tree for the identifier AB5C8.
1. Use the algorithm described in our course materials (videos) that takes a CFG and converts it into a CNF grammar that generates the same language as the original grammar, except possibly for the string A, to answer the following question. As part of your answer, you should say which variables are nullable, and you should give the appropriate grammar after each step of the algorithm. There are four steps. Give a CFG (context-free grammar) in CNF (Chomsky Normal Form) that generates the same language, except possibly for the string A, as the following grammar: S АВ → abA|A → bBb|bb A B
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 .