Register

TOC (GRAMMAR)
closed

• closed by
397 views
1 votes
1 votes
closed as a duplicate of: GATE CSE 2009 | Question: 12, ISRO2016-37
What is the language accepted by the given Grammar ?

S -> aSa / bSb / a / b
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.4k
views
2 answers
1 votes
KISHALAY DAS asked Dec 10, 2016
1,375 views
TOC-Linear Grammar
User Avatar
1.4k
views
2 answers
1 votes
shekhar chauhan asked Jun 15, 2016
1,446 views
TOC Grammar
What is the Language represented by this L = {w / where w ={a ,b}} and Na(w)>=Nb(w)+1.What is the machine which can be used to process this lang ?
User Avatar
568
views
2 answers
1 votes
Sukhbir Singh asked Apr 30, 2019
568 views
Deletion of Useless Symbols from a Grammar Self Doubt
S → AB/aA → BC/bB → aB/CC → aC/BHow do we remove useless symbols and productions from this grammar?While solving, i found that the useful symbols are {a,b,S,A}Hence, we must delete B,CBut don’t know how to proceed
User Avatar
687
views
1 answers
0 votes
Prince Sindhiya asked Jan 2, 2019
687 views
Zeal Test Series 2019: Theory of Computation - Grammar
Consider the following statements.S1: An unambiguous left recursive grammar must be CLR(1).S2: A DCFG may or may not be LL(1).Select the correct option:1.Both S1 ... and S2 is false. According to me S1 false and S2 true but answer given 1
User Avatar
Link Copied!