39
•
Predictor (=top-down rule)
•
Scanner (=fundamental rule on terminals)
•
Completer (=fundamenta l rule on nonterminals)
Gambar 2.7
Aturan dalam Algoritma Earley
Berikut adalah algoritma sed erhana d ari algoritma Earley :
For each rule S?a in the grammar:
Add S?•a
to chart[0,0]
For i = 0 to N:
for edge in queue[i] :
if edge is incom plete and edge.next is a part of speech:
scanner(edge)
if edge is incom plete and edge.next is not a POS:
predictor(edge)
if edge is complete:
com pleter(edge)
Gambar 2.8
Algoritma Earley
 |