a) Give a context-free grammar that generates amb"akb" | n 2 0, m > 0, k > 0 b) Give a context-free grammar that generates a'b*c | i 2 0, k 2 0,j 2* (ki)}. c) Give a context-free grammar that generates the set of all well formed parentheses. The alphabet contains two symbols, namely "(" and ")". The following strings of length 6 are well formed parentheses: 0, (00), O(0), (0)0, ((()). But the following are not: ))(, ()(. This question requires some careful thinking

a) Give a context-free grammar that generates amb"akb" | n 2 0, m > 0, k > 0 b) Give a context-free grammar that generates a'bc | i 2 0, k 2 0,j 2 (ki)}. c) Give a context-free grammar that generates the set of all well formed parentheses. The alphabet contains two symbols, namely "(" and ")". The following strings of length 6 are well formed parentheses: 0, (00), O(0), (0)0, ((()). But the following are not: ))(, ()(. This question requires some careful thinking

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

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
3. Write a correct recursive descent grammar that correctly recognizes arithmetic expressions involving variable, number, + - * / **. Variable and number are tokens recognized by the lexical analyzer along with the operators + - * / and **. There are three levels of hierarchy, ** before *, / before + -. This grammar does not support unary + and -.
Let L = {w = [a, b}*: every a in w is immediately followed by at least one b}.
DO NOT COPY FROM OTHER WEBSITES. THANK YOU! Q. Remove Left Recursion from the following grammar MoneyHeist → Berlin+Professor | ++Rio | Denver*TokyoBerlin → MoneyHeist | (Berlin+Tokyo) | +Professor → Rio | TokyoProfessor+ | BerlinRio → MoneyHeist++ | * | +Denver → MoneyHeist(Berlin+Professor)Tokyo → + |++ | ** | ∈
: Consider the following Operator Grammar: E -> E + E | E* E | (E) | id Show the actions of Operator Precedence Parser on the input (id + id * id) + id $
Consider the following grammar: → a b > b | b b Which of the following sentences are in the language generated by this grammar? a. babb b. bbbabb c. bbaaaaabc d. aaaaaa
Remove left recursion from the following grammar:S -> Aa | Bb A -> Aa | Abc | c | Sb B -> bb
3. Given the following BNF grammar: -> d c | cd -> a la -> b | b Use the top-down recursive descent method which we discussed in the class to implement a parser (i.e. tdrd.parser.py) in python3 for the above BNF grammar. The input data file name is given from the command line. You may assume that there is a space character between two terminals (e.g. a a adc b ) in the data file.
Create a context free grammar for each of the followinglanguages.a. L = { a i b j | i < j }b. L = { a i b j ck d l | 0 < j < i, 0 < l < k }c. L = { a i b j ck d l | i = l, j < k }
13-Write a grammar for the language consisting of strings that have n copies of the letter a followed by the same number of copies of the letter b and the the same number of copies of the letter c, where n >0. For example, the strings abc, aaaabbbbcccc, and aaaaaaaabbbbbbbbcccccccc are in the language but a, abbc, bac, and aaabbbcc are not
Q1: Write a grammar for the language that includes all strings containing n copies of alphabet a, followed by n+1 copies of the alphabet b. Assume ? > 0. Upon completion of the grammar definition, draw the parse tree for the sentences abb and aabbb along with the derivations.Q2: Consider the identifier definition of a hypothetical programming as follows: strings of consist of letters and numbers, and they must begin with a letter.
* :A grammar G=(V,T,P,S) in which V is -2 None of these O set of variables and terminals O set of terminals O set of variables O