1,941 views
4 votes
4 votes
Which of the following is TRUE regarding the running time of a LR(1) parser?
  1. It runs in linear time for all inputs
  2. It runs in polynomial time but not necessarily $O(n^3)$ for all inputs
  3. For some inputs it may take exponential time
  4. It runs in $O(n^3)$ but not always $O(n^2)$

Please log in or register to answer this question.

Answer:

Related questions

6 votes
6 votes
2 answers
1
Arjun asked Jan 26, 2019
1,687 views
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduceshift-reduce conflictreduce-reduce conflictno extra conflictboth shift-reduce as well as redu...
4 votes
4 votes
2 answers
2
Arjun asked Jan 26, 2019
835 views
Suppose we have a rightmost derivation which proceeds as follows:$\begin{array}{ccc}S &\rightarrow & Aabw \\ & \rightarrow &ABw \end{array}$Which of the following is a po...
3 votes
3 votes
1 answer
4