Question

Write the CFG for the following languages a) A languages that contain odd length strings (Draw...

Write the CFG for the following languages
a) A languages that contain odd length strings (Draw the parse tree for aabbabababa)
b) A language that contains at least 3 b’s are valid. (Draw the parse tree for baabaaaabba)
c) a+b * (c-d*e) /f (Draw its parse tree also)

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
1.2 Which of the following statements is wrong?        a). A set is a subset of itself...
1.2 Which of the following statements is wrong?        a). A set is a subset of itself        b). Emptyset is a subset of any set        c). A set is a subset of its powerset        d). The cardinality of emptyset is 0 1.3. Which of the following statements is correct?        a). A string is a set of symbols from an alphabet        b). The length of the concatenation of two strings can           be the same as one of them        c). The length of...
Draw the state diagram of DFAs recognizing the following languages. a. A = {w|w starts with...
Draw the state diagram of DFAs recognizing the following languages. a. A = {w|w starts with 0 and has odd length, or starts with 1 and has even length} b. B = {w|w is any string except 11 and 111} c. C = {, 0} Example of set difference: A = {0, 01}, and B = {0, 11}. Then, A − B = {01}. Prove that regular languages are closed under the set difference operation. That is, if A and...
Write a formal grammar that generates all strings of odd length over Σ = {a, b}.
Write a formal grammar that generates all strings of odd length over Σ = {a, b}.
Do each of the following. a) How many ternary strings of length 20 contain at least...
Do each of the following. a) How many ternary strings of length 20 contain at least four 1s? (Hint: A ternary string consists of 0s, 1s, and 2s.) b) How many ternary strings of length 20 contain exactly four 1s?
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA...
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA which accepts strings of odd length Design a DFA over w ∈ {a,b}*such that number of a = 2 and there is no restriction over length of b DFA for Number of a(w) mod 2 = 0 and Number of b(w) mod 2 = 0 DFA for Number of a(w) mod 2 = 0 orNumber of b(w) mod 2 = 0 DFA for Number...
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length...
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length 4 with repetitions contain A and B. How about without repetitions?
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over...
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over the alphabet of {0}. b) Define a regular expression for identifiers over the alphabet of {A,B,C,a,b,c,0,1,2,3,4,5,6,7,8,9}, such that an identifier must begin with an alphabetic character and must contain at least one numeric character. c) Try to modify the definition above so that identifiers still begin with an alphabetic character, but after that, it must contain at least one numeric, at least one lower-case...
Assignment-I Do the Lexical Analysis and draw the parse tree in the syntax analysis for the...
Assignment-I Do the Lexical Analysis and draw the parse tree in the syntax analysis for the following source code statement                        “ Sum : = PI + r1 * r2*80 “ Draw the transition diagram and transition table for NFA that recognizes the language:                     (a | b)* aabbb If x and y are strings ; write the answers for the following if x=”Hello” and y=”Welcome” : x2y4= xy2  =   x5 y.epsilon =
Write the regular expression for the following sets (4.5) 4.1 All strings over {a,b} that are...
Write the regular expression for the following sets (4.5) 4.1 All strings over {a,b} that are odd in length 4.2 All strings over {a,b} whose length is not a multiple of 3 4.3 All strings over a,b that start with aa and end with bb
1. a) Rewrite the following rule base as a CFG and provide its formal definition (...
1. a) Rewrite the following rule base as a CFG and provide its formal definition ( S is the start state ) S → aSb | bAA A → b {aB} | a | Bc B → aB | c b) Generate the 10 smallest possible strings using the above rule base. ( from problem a) 2. Either show that the following strings are in this language or state why these strings can not be.. S → AB | BC...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT