Results 21 to 30 of about 169,566 (212)
Full LR(1) parser generation [PDF]
ACM SIGPLAN Notices, 1981 Full LR(1) parser generation is discussed and shown to be useful and practical, in contrast to current widespread misconception.
David Spector
openalex +2 more sources
Generating LR(1) parsers of small size [PDF]
, 1992 Classic LR(1) parsing methods have the problem of producing too large parsing tables for programming language grammars. An alternative is to build an automaton that combines the lookahead symbol with reading the parsing stack from its top, to determine the next parsing action.
Fortes Gálvez José
openalex +4 more sources
Repairing syntax errors in LR parsers [PDF]
ACM Transactions on Programming Languages and Systems, 2002 This article reports on an error-repair algorithm for LR parsers. It locally inserts, deletes or shifts symbols at the positions where errors are detected, thus modifying the right context in order to resume parsing on a valid piece of input. This method improves on others in that it does not require the user to provide additional information about the
Corchuelo Gil, Rafael +3 more
openaire +3 more sources
LL conflict resolution using the embedded left LR parser
Computer Science and Information Systems, 2012 A method for resolving LL(k) conflicts using small LR(k) parsers (called embedded left LR(k) parsers) is described. An embedded left LR(k) parser is capable of (a) producing the prefix of the left parse of the input string and (b) stopping not on ...
B. Slivnik
semanticscholar +1 more source
Penerapan Algoritma Lalr Parser Dan Context-free Grammar Untuk Struktur Kalimat Bahasa Indonesia [PDF]
, 2017 Penyajian bahasa dalam bentuk tulisan, dapat menyimpan pengetahuan dari generasi ke generasi berikutnya. Setiap penulisan karya tulis seperti buku, hendaknya ditulis dengan tata bahasa yang benar sesuai kaidah-kaidah bahasa Indonesia, karena akan ...
Hidayat, T. (Taufiq) +2 more
core +2 more sources
Towards Efficient, Typed LR Parsers
Electronic Notes in Theoretical Computer Science, 2006 AbstractThe LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to produce parsers that are well-typed (so they cannot unexpectedly crash or fail) and nevertheless efficient ...
Pottier, François, Régis-Gianas, Yann
openaire +2 more sources
Automatic error recovery for LR parsers [PDF]
Communications of the ACM, 1978 In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser.
M. Dennis Mickunas, John A. Modry
openalex +2 more sources
A grammatical specification of human-computer dialogue [PDF]
, 1995 The Seeheim Model of human-computer interaction partitions an interactive application into a user-interface, a dialogue controller and the application itself.
Nymeyer, Albert
core +2 more sources
Proceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, 1996 Describes a Viterbi search algorithm for continuous speech recognition using context-dependent phone models under the constraint defined by a context-free grammar (CFG).
Tomokazu Yamada, S. Sagayama
semanticscholar +1 more source
A generalized LR parser for text-to-speech synthesis
Proceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, 1996 The development of a parser for a Norwegian text-to-speech system is reported. The generalized left-right (GLR) algorithm is applied, which is a generalization of the well-known LR algorithm for parsing computer languages.
Per Olav Heggtveit
semanticscholar +1 more source