The Gateway to Computer Science Excellence
0 votes
146 views
Consider a CFG contains ‘n’ tokens. What is the best case time complexity of LL(1) parsing n tokens?
in Compiler Design by Active (4.7k points) | 146 views

1 Answer

+1 vote
Best answer
top down parsers need O(n^4) .....(LL1)

Bottom up pasrsers need O(n^3)
by Active (2.9k points)
selected by
0
@amitabh...any proof or Algo form which we can derive?
0
I read it in ullman.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,168 answers
193,841 comments
94,046 users