Looking for FAF.LFPC21.1 Limbaje Formale și Automate test answers and solutions? Browse our comprehensive collection of verified answers for FAF.LFPC21.1 Limbaje Formale și Automate at else.fcim.utm.md.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Remove unproductive symbols for the following grammar:
P={S-> aAb|aAB
A->aA|a
C->bD|CA
B->b|CA|Db
}
Remove unit-productions for the following grammar:
P={S-> AB
A->a
B->C|b
C->D
D->E
E->a
}
Simplify grammar:
P={S-> 0S1
S-> 0SH
S-> 0
S-> 1B0
B-> 1A0
B-> SH
A-> 1AB
A->SB
}
Remove ε-productions for the following grammar:
P={S-> AzAA
A->a
A->ε
}
Remove ε-productions for the following grammar:
P={S-> S0
S->1
S->AB
B->AC
A->ε
C->ε
}
G= (VN, VT, S, P), VN = {S, B, C}, VT = {a, b}, P={S->aSBC; BC->Bab; C->a; B->b| ε }.
G= (VN, VT, S, P), VN = {S, T}, VT = {0, 1}, P={S->1S|0T| ε; T->1T|0S}.
G= (VN, VT, S, P), VN = {S, A, B }, VT = {a, b}, P={S->aAB; A->a; B-> b}.
G= (VN, VT, S, P), VN = {S, A, B, C}, VT = {a, b, c}, P={S->ABC|ABCS; AB->BA; AC->CA; BC->CB; BA->AB; CA->AC; CB->BC; A->a; B->b; C->c}.
G= (VN, VT, S, P), VN = {S}, VT = {0, 1}, P={S->0S1S|1S0S| ε }.