0 votes 0 votes COMMENT(how the below statement is true) LL(k) languages are proper subset of LL(k-1) languages. Compiler Design compiler-design parsing made-easy-booklet + – Jyoti Kumari97 asked Nov 18, 2018 • edited Mar 5, 2019 by ajaysoni1924 Jyoti Kumari97 339 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 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. Raj_81 answered Sep 23, 2019 Raj_81 comment Share Follow See all 0 reply Please log in or register to add a comment.
