The Gateway to Computer Science Excellence
0 votes
73 views
COMMENT(how the below statement is true)

LL(k) languages are proper subset of LL(k-1) languages.
in Compiler Design by
edited by | 73 views

1 Answer

0 votes

Actually the power of LL(k) grammar strictly increases with an increase in ‘k’.

i.e., the language of LL(k) is a strict subset of the language of LL(k+1).

refer:-link

So this is false.

 

by
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
52,345 questions
60,479 answers
201,803 comments
95,279 users