Register

Consider the below grammar : S -> AaAb | BbBa A -> ɛ B -> ɛ The grammar is :
closed

• closed by
1,418 views
1 votes
1 votes
closed with the note: Wrong format
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
insu_prince asked May 19, 2022
283 views
Consider the grammar given below T-> Ta|epsilon ,E-> T|E;T , S-> E#. ?
The above grammar is slr(1) ,lr(0) ?
The above grammar is slr(1) ,lr(0) ?
User Avatar
1 votes
1 votes
2 answers
2
ari asked Aug 19, 2015
4,425 views
Consider this grammar: S → SS | a How many derivation trees are possible for a^4 ? (a) 3 (b) 4 (c) 5 (d) 6
Consider this grammar: S → SS | a How many derivation trees are possible for a^4 ? (a) 3 (b) 4 (c) 5 (d) 6 Is there any formulae to solve this kind of problem?
User Avatar
0 votes
0 votes
1 answer
4
worst_engineer asked Jan 18, 2016
609 views
Consider the two hosts A and B are connected via a Router as shown below
My doubt is , should we not take RTT in calculation ?
My doubt is , should we not take RTT in calculation ?
User Avatar
Link Copied!