Register
Dark Mode

LL(1)

in Compiler Design edited by
2,295 views
0 votes
0 votes

in Compiler Design edited by
by
2.3k views

1 comment

by
option D?
0
0

1 Answer

0 votes
0 votes
Both left recursion and left factoring
by

4 Comments

Show 9 previous comments
by
0
0
by
@Shivam,

yes.
0
0
by
Non left factored grammar is non deterministic (containing Common prefixes) which is converted into left factored grammar or deterministic grammar and this process is called Left factoring.
1
1
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
3 answers
1
Parshu gate asked in Compiler Design Dec 5, 2017
1,555 views
Type of grammar
Why isn't it LL(1) ?
Parshu gate asked in Compiler Design Dec 5, 2017
by Parshu gate
1.6k views
0 votes
0 votes
1 answer
2
Aditya Bahuguna asked in Compiler Design Dec 4, 2017
235 views
ace test series
Aditya Bahuguna asked in Compiler Design Dec 4, 2017
by Aditya Bahuguna
235 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!