Parse tree ==> left-most derivation

Parse tree ==> left-most derivation
DFS left to right
Parse tree ==> right-most derivation
DFS right to left
==> left-most derivation == right-most derivation
Derivation ==> Recursive inference
Reverse the order of productions
Recursive inference ==> Parse trees
bottom-up traversal of parse tree

Hasil (Bahasa Indonesia) 1:

Mengurai pohon == > paling kiri derivasiDFS kiri ke kananMengurai pohon == > paling kanan derivasiDFS kanan ke kiri== > paling kiri derivasi == derivasi paling kananDerivasi == > rekursif kesimpulanMengubah urutan produksiKesimpulan rekursif == > Parse pohonbawah-atas traversal mengurai pohon

Hasil (Bahasa Indonesia) 2:

Mengurai pohon ==> kiri-paling derivasi
DFS kiri ke kanan
pohon Parse ==> paling kanan derivasi
DFS kanan ke kiri
==> kiri-paling derivasi == paling kanan derivasi
Penurunan ==> inferensi Rekursif
Membalik urutan produksi
rekursif inferensi ==> pohon parse
traversal bottom-up pohon parse