We have a grammar with not epsilon and unit production (i.e. of type A->ε and A ->a) to parse a string, with n tokens. What is the maximum number of reduces moves that can be taken by a bottom-up parser for this grammar?

We have a grammar with not epsilon and unit production (i.e. of type A

1.	We have a grammar with not epsilon and unit production (i.e. of type A->ε and  A ->a) to parse a string, with n tokens. What is the maximum number of reduces moves that can be taken by a bottom-up parser for this grammar?
A.	2n - 1
B.	2n
C.	n-1
D.	n/2
Answer» B. 2n

Discussion

No Comment Found

Related MCQs

Which one of the following statement about HTTP is false?
_____________ indicates a correct association of the three commands PROMPT, HEAD and RCPT with protocols where these are used.  
The objects that can be used in expression and scriplets in JSP without explicitly declaring them is
We have an HTML form that is to be designed to enable purchase of office stationary. For the items that are selected mark it with check. Submit button is to be pressed ones the credit card details are filled. Assuming that security is handled in a way that is transparent to the form design, the option that would be appropriate for sending the data to the server is   
Out of the four test cases, the test cases that will be successful in exposing the flaw if array p is made to hold the string abcde is  
If the tester carries out the testing of the program on all input strings of five characters a, b, c, d and e with duplicates allowed using these test cases, the number of test cases  that will be able to capture the flaw is  
A software for digital signal processing which is expected to have 40000 lines of code needs to be developed by a company. This software is to be developed using the basic COCOMO model and for this the company needs to determine the effort in person-months. For the software development on the embedded system, the multiplicative factor for this model is 2.8 and the exponentiation factor is 1.20. The estimated effort in person month is  
Out of the options given below the one, which is not a client server application is 
For the good software requirement specifications (SRS) document
In some programming language, L denotes the set of letters and D denotes the set of digits. An identifier is permitted to be a letter followed by any number of letters or digits. The expression that defines an identifier is

We have a grammar with not epsilon and unit production (i.e. of type A-&gt;&epsilon; and&nbsp; A -&gt;a) to parse a string, with n tokens. What is the maximum number of reduces moves that can be taken by a bottom-up parser for this grammar? &nbsp;

Discussion

No Comment Found

Related MCQs

Reply to Comment

We have a grammar with not epsilon and unit production (i.e. of type A->ε and A ->a) to parse a string, with n tokens. What is the maximum number of reduces moves that can be taken by a bottom-up parser for this grammar?