LL Parsing Flashcards

1
Q

What is top-down parsing?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the simple leftmost strategy?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What LL-parsing? What is its starting point? What are its steps?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

When is a variable useless?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How to determine if a variable is useless?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

When is a variable productive?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

When is a variable reachable?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How to determine the set First(A)?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How to determine the set Follow(.)?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a parser table?

LL parsing

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are the steps of a LL(1) parser?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is a LL(k) grammar?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is Left Factorization?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly