Register

ME TEST Series question ON CFG

• retagged by
288 views

1 Answer

0 votes
0 votes

Answer is D.

S-> (S (Since S-> (S )

S->(R (Since S-> R )

S->((R) (Since R-> (R) )

S->(()R() (Since R-> )R( )

S->(())R(() (Since R-> )R( )

S->(())(() (Since R-> ε )

So final answer is string (())(() , that is option D.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
amitqy asked Oct 19, 2018
385 views
made easy test series
Answer given is 4.
Answer given is 4.
User Avatar
1 votes
1 votes
5 answers
2
User007 asked Oct 5, 2016
706 views
MADE EASY TEST SERIES
Consider the following CFG: E --> E*T/T+E/T T --> (T*F)/F F --> id Which of the following strings are not generated by above CFG? A> id+id+id B> id∗id∗id C> (id∗id∗id) D> None of these
Consider the following CFG:E E*T/T+E/TT (T*F)/FF idWhich of the following strings are not generated by above CFG?A id+id+idB id∗id∗idC (id∗id∗id)D None of t...
User Avatar
0 votes
0 votes
1 answer
3
Shankar Kakde asked Jan 24, 2019
663 views
ACE Test series Question on CFG
User Avatar
0 votes
0 votes
2 answers
4
atulcse asked Jan 16, 2022
907 views
made easy test series - parsing - context-free grammar
Consider the following context-free grammar: Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
Consider the following context-free grammar:Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
User Avatar
Link Copied!