Exercises Flashcards
1
Q
Equations of regular expressions
A
2
Q
From FA to regular expression
A
3
Q
From right-regular grammar to FA
A
4
Q
From left-regular grammar to FA
A
5
Q
Minimization of DFA
A
6
Q
Complement of a regular language
A
7
Q
Equivalence of regular languages
A
8
Q
Eliminate useless symbols in CFG
A
9
Q
Write a PDA
A
10
Q
SA Bottom-up parser
A
11
Q
LR(0) parsing table.
Is the grammar LR0?
A
The grammar is not LR if it is ambiguos
12
Q
LR(SLR) parsing table
A
13
Q
LR(1) parsing table
Is the grammar LR1?
A
3REDUCE action for all lookahed symbols
Not LR1 if conflicts exist.
14
Q
LALR(1) parsing table
Is the grammar LALR(1) ?
A
The grammar is not LALR if it is ambiguos
15
Q
SA Top-down parser
A
16
Q
Eliminate left-recursion
A
17
Q
Predictive LL(1) parsing table
Is the grammar LL1?
A
If the grammar is left recursive or has conflicts in the parsing table is not LL1
