Register

what is the number of steps required to derive the string ((() ()) ()) for the folling grammar
closed

• closed by
409 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
Sanjay Sharma asked Apr 16, 2017
3,089 views
Number of productions to derive a string of length x
User Avatar
3 votes
3 votes
4 answers
2
Harit asked Apr 25, 2016
5,659 views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?S → aB | aAbA → bAb | aB → aB | ε
User Avatar
1 votes
1 votes
2 answers
3
sh!va asked Jul 12, 2016
5,565 views
What is the minimum number of multiplications required to compute the chain of matrices?
What is the minimum number of multiplications required to compute the chain of matrices A = A1.A2.A3.A4 with size of A1 is 10x100, A2 is 100x5, A3 is 5x50, and A4 is 50x1?
What is the minimum number of multiplications required to compute the chain of matrices A = A1.A2.A3.A4 with size of A1 is 10x100, A2 is 100x5, A3 is 5x50, and A4 is 50x1...
User Avatar
1 votes
1 votes
0 answers
4
brijmohan asked Aug 6, 2016
736 views
The string for which the grammar has maximum of two derivation trees is
The string for which the grammar has maximum of two derivation trees is (a) lion tiger lion (c) tiger lion (b) lion tiger (d) None of the above
The string for which the grammar has maximum of two derivation trees is(a) lion tiger lion(c) tiger lion(b) lion tiger(d) None of the above
User Avatar
Link Copied!