The following two questions concern the following grammar:
S -> bAB
A -> bB | a
B -> aA | λ
6.1. Which of the following is a correct derivation for bbaaab?
a. S => bAB => bAaA => bbAaA => bbaaA => bbaaaB => bbaaab
b. S => bAB => bbBB => bbBaA => bbBabB => bbaAabB => bbaaabB => bbaaab
c. S => bAB => bbBB => bbBaA => bbBabB => bbaaabB => bbaaab
d. S => bAB => bbBB => bbBaB => bbAabA => bbaAabB => bbaaabB => bbaaab
I chose b, is that right?
Formal Languages and Automata
Page 1 of 16 Replies - 1748 Views - Last Post: 26 June 2012 - 02:11 PM
Replies To: Formal Languages and Automata
#2
Re: Formal Languages and Automata
Posted 26 June 2012 - 10:02 AM
Yes, that's right. All the other derivations either contain an invalid step or are doing two steps in one.
#3
Re: Formal Languages and Automata
Posted 26 June 2012 - 01:52 PM
I know that I am a novice poking around in the forums that I do not understand, but could you please drop a link to an explanatory text?
#4
Re: Formal Languages and Automata
Posted 26 June 2012 - 01:57 PM
Quote
explanatory text
Of what part?
#5
Re: Formal Languages and Automata
Posted 26 June 2012 - 02:00 PM
#6
Re: Formal Languages and Automata
Posted 26 June 2012 - 02:09 PM
*Sigh*.. so you've hit the formal language wiki link, right?
edit:
Generative grammar
https://www.msu.edu/...omp-lecture.pdf
edit:
Generative grammar
https://www.msu.edu/...omp-lecture.pdf
#7
Re: Formal Languages and Automata
Posted 26 June 2012 - 02:11 PM
Err...um...nervous giggle...um...eh...er... sort of-kinda-ish?
Page 1 of 1

New Topic/Question
Reply


MultiQuote






|