Consider the language L defined by the following grammar with productions S-> AB A -> a | Ab B-> b| Ba Which of the following statements are true for all sentences of L? Each sentence contains exactly as many a's as b's. Each sentence contains one or more b's. Each sentence contains at least two letters. O Each sentence contains one or more a's. O All as precede all b's.

Consider the language L defined by the following grammar with productions S-> AB A -> a | Ab B-> b| Ba Which of the following statements are true for all sentences of L? Each sentence contains exactly as many a's as b's. Each sentence contains one or more b's. Each sentence contains at least two letters. O Each sentence contains one or more a's. O All as precede all b's.

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

Are the following languages context-free or non-context-free? • If a language is context-free, give a context-free grammar that generates it. If a language is not context-free, prove this using the pumping lemma. B = {a*t*c*d• | i > k > 1, m > 1}
Which of the following statement is not true with respect to context free grammar? Context free grammar is also called Type 2 grammar. O b. Push down automata accepts strings produced by context free grammar O C. Context free grammar is powerful than regular grammar. Od. The language generated by context free grammar is called context sensitive language.
You are given a context free grammar G and a string S. Find the minimum Levenshtein distance between S and any string W accepted by G. The first line of the input contains two space-separated integers Vand R denoting the number of non-terminals and the number of productions of G The following Rlines describe productions. Each line starts with an integer Tdenoting the production type. If T=0, a space and three space-separated integers X, Yand Z denoting a production X→YZ If T=1, a space, an integer X, another space and a character cdenoting a production X→c If T=2, a space and a single integer Xdenoting a production X→ε The next line contains a single integer ST denoting the starting symbol of G. Last line contains the string S as explained in statement. Input: 5 7 0 0 1 2 0 0 3 4 2 0 1 1 a 1 3 b 0 4 0 3 0 2 0 1 0 ababb Output: 2
Dwayne Johnson has got an assignment from his Professor of TOC. He has the alphabet set E = {a, b, (, ), U, *, Ø}. Dwayne Johnson has to make a context-free grammar which generate all string in E* which are regular expressions over the set {a, b}. If Dwayne Johnson can do this he will be promoted to the elite section but if he fails he will be demoted. You have to help Dwayne go to elite section by doing this task for him.
Computer Science Let L = { w e {a,b,c}*: w has a substring 'aa' and a substring 'ab'} a. Find a NFA for L o. Give a regular expression for L. c. Find a right linear grammar for L.
We have introduced some languages involving DFA/NFA that are decidable. For example, we have introduced EDFA = {{B)|B is a DFA and L(B) = Ø}, which can be decide by a TM DEDFA . We can construct TM DEDFA in this way: given (B), DEDFA will mark the states of B to check whether finally any accept state can be marked. Furthermore, we have used this TM DEDFA to construct a TM decider for another language EQDFA = {{A,B)| A,B are DFAS and L(A) = L(B)}. See the allowed lecture slides for details. Now, follow this idea, use this DEDFA to construct another Turing machine DSUB that decide the language SUBDFA = {(A,B>| A,B are DFAS, L(A) C L(B)}.
2. Are the following languages context-free or non-context-free? • If a language is context-free, give a context-free grammar that generates it. • If a language is not context-free, prove this using the pumping lemma. A = { a*b'c*d² |k > i > 0, l>0 } B = {a²i+1fk+1c3l (2k+1q* | i > 1, k > 1, l > 1 } (a) (b)
T and F
I need help with my context free language. It needs to do the following 1. Developing a language model based on the context-free grammar: Use the context-free grammar to develop a language model that can be used to generate coherent and grammatically correct sentences in American English.2. Incorporating semantic information into the context-free grammar: Expand the context- free grammar to incorporate semantic information, such as word meaning and context, to generate more meaningful sentences in American English. here is my Java code import java.util.*;import java.util.stream.Collectors; public class CFG { private static Map<String, List<String>> rules; public static void main(String[] args) { rules = new HashMap<>(); initializeGrammarRules(); String sentence = generateSentence("S"); System.out.println(sentence); } private static void initializeGrammarRules() { rules.put("S", Arrays.asList("NP VP"));…
Let { a b } be the alphabet set. Write a Context free grammar CFG for each of the followinglanguages:a) L = Language of all palindromeb) L = language of equal no of a’s and b’c) { \ m ≠ n, m, n ∈ N}d) R.E. = b(a+b)*e) R.E. = (ab + b)*f) R.E. = ab(ba)* + bb please solve all the parts kindly