5. Consider the following FIRST and FOLLOW sets, F, where S is the start symbol. a) Create the simplest context-free grammar that has fewest productions and fewest grammar symbols at right-hand sides. The hints of the answer is shown in the grammar template, A. In other words, you should fill out the six blanks in A. (10pt) b) Extend the context-free grammar that you derived in a) to create another grammar with a shift-reduce conflict. Please clearly indicate the shift-reduce conflict. FIRST and FOLLOW sets, P 5-) Ta FIRST(S) . (b, e) FIRST(T) Tb - (b, e) FOLLOW(S) . FOLLOW(T) (a. $) 776 W (a, b, $) 12 T& Grammar template, A: (You should write on the answer sheet.) [4 ablat 1 (3) KN 1 (5) 1 (6) (2) TE ١٤ туть PIE

5. Consider the following FIRST and FOLLOW sets, F, where S is the start symbol. a) Create the simplest context-free grammar that has fewest productions and fewest grammar symbols at right-hand sides. The hints of the answer is shown in the grammar template, A. In other words, you should fill out the six blanks in A. (10pt) b) Extend the context-free grammar that you derived in a) to create another grammar with a shift-reduce conflict. Please clearly indicate the shift-reduce conflict. FIRST and FOLLOW sets, P 5-) Ta FIRST(S) . (b, e) FIRST(T) Tb - (b, e) FOLLOW(S) . FOLLOW(T) (a. $) 776 W (a, b, $) 12 T& Grammar template, A: (You should write on the answer sheet.) [4 ablat 1 (3) KN 1 (5) 1 (6) (2) TE ١٤ туть PIE

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

A) Write a BNF grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must start with a aa. For example, the strings aaabbabbba, aaaababba, and aababbabb are in the language, while a, bba, ababb, aabaa, and bbaa are not. B) Draw the parse tree for string aabbaaba according to the previous grammar: C) Describe, in complete English sentences and “layman’s terms,” the language defined by the following grammar in BNF (start symbol is <S>):<S> ::= <A>a | b<C> ::= c<A> ::= a<A>a | <C> ::= bb | <C>
1.Eliminate left recursion from the production rules that are given in below. E = E + T / T 2.Define context-free grammar. 3.Write down the characteristic of context-free grammar.
1. Consider the following grammar. A AaA a) What is the type of the grammar according to Chomsky hierarchy? Why? b) Find the language generated by the grammar. c) Design another grammar with a more restrictive type that generates the same language you found in (b). (e.g. if the given grammar is Type-1 then design a Type-2 or Type-3 grammar.) d) Is it possible to write a regular expression for the grammar you designed in (c)?
a. Write a BNF grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must start with a aa. For example, the strings aaabbabbba, aaaababba, and aababbabb are in the language, while a, bba, ababb, aabaa, and bbaa are not. b. Draw the parse tree for string aabbaaba according to the previous grammar: c. Describe, in complete English sentences and “layman’s terms,” the language defined by the following grammar in BNF (start symbol is <S> ): <S>::= <A>a|b <C>::= c <A>::= a<A>a|<C> ::= bb|<C>
Q1: Explain the concepts of ambiguity of a grammar. Take an example of your choice and show that the grammar is ambiguous. Draw the parse tree as needed. Q2: Select three flow control statements from C-programming, or from any other programming of your choice, and explain how the relevant grammars are written.
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.
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Let G = (V, T, S, P) be the phrase-structure grammar with V = {0, 1, A, S}, T = {0, 1} and a set of productions P consisting of S → 1S, S → 00A, A → 0A, and A → 0. Identify the correct argument to show that 11001 does not belong to the language generated by G. Multiple Choice A) Every production results in a string that ends with S , A, or 0. Therefore, the string 11001, which ends with a 1, cannot be generated. B) Every production results in a string that does not contain S , A, or 0. Therefore, the string 11001, which contains 0, cannot be generated. C) Every production results in a string that starts with S , A, or 0. Therefore, the string 11001, which starts with a 1, cannot be generated. D) Every production results in a string that contains S , A, or 0. Therefore, the string 11001, which contains 1, cannot be generated.
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
1- Here we have a practical grammar for generating four-function expressions as below. Please remove all left recursions in the grammar (show your elimination steps). E → E + T | E – T | T T → T * F | T/F | F F → int | (E) 2- Please determine the FIRST and FOLLOW from the revised grammar (that does not contain left recursions) in above Question 1.
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.
I. Represent the Context – free grammar of the following language: L = (anbm I n>=0, m>n) II. Construct a derivation tree of the context – free grammars in Step I above to give the following sets of strings: A. aabbbb B. abb
a. Eliminate Left Factoring from the grammar above. b. Eliminate Left Recursive from the grammar above if there is any.