Sistem Penganalisis Sintaks Otomatis dengan Metode Generalized-LR Parsing
| Main Authors: | Mandala, Rila, Sigit, Antonius, Munir, Rinaldi, Harlili, Harlili |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia
, 2009
|
| Online Access: |
http://journal.uii.ac.id/index.php/Snati/article/view/1826 http://journal.uii.ac.id/index.php/Snati/article/view/1826/1606 |
Daftar Isi:
- The main problem of difficulties in natural language processing is ambiguity. Almostin all level of natural language processing there are ambiguities, including in syntax level.LR-Parser is an efficient method that often be used in developing a programming languagecompiler for parsing, but unfortunately it can not be used for parsing natural languageprocessing because it can not handle the ambiguity. This paper uses Generalized-LR Parsing,a modified-LR-Parsing method that can handle ambiguity, for parsing a sentence in BahasaIndonesia. Generalized-LR Parsing use a graph-structured stack to cope the ambigutiyproblem. It can successfully produce all parsing-trees for an ambiguous sentence in BahasaIndonesia.Keywords: natural language processing, syntax analysis, ambiguity, Generalized LRParsing,parsing-tree