Results 161 to 170 of about 636 (187)
Some of the next articles are maybe not open access.
An LR parser with pre-determined reduction goals
Information Processing Letters, 1999전산학과
Lee, GO, Choe, KM Choe, Kwang-Moo
openaire +2 more sources
Applied Mechanics and Materials, 2013
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.
openaire +1 more source
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.
openaire +1 more source
Syntax-Error Recovery in LR-parsers
1976An efficient algorithm for error-recovery in LR-parsers is presented. The algorithm is capable of repairing all syntax errors without backtracking, in time proportional to the stack depth. It needs only a small table, a mapping from the states of the parser into the terminal symbols. The algorithm is very similiar to the parser itself. Thus, it has the
openaire +1 more source
ACM SIGPLAN Notices, 1986
The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
openaire +1 more source
The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
openaire +1 more source
Improved error recovery in generated LR parsers
Informatica (Slovenia), 2004Summary: A new method for error recovery in LR parsers is described. An error recovery routine based on this new method can be generated automatically by a parser generator as a part of an LR parser. Based on the result that a viable suffix from which the unread part of the input is derived can be computed in certain states of an LR parser, the new ...
Slivnik, Boštjan, Vilfan, Boštjan
openaire +2 more sources
Annotation Projection-based Dependency Parser Development for Nepali
ACM Transactions on Asian and Low-Resource Language Information Processing, 2023Pooja Rai, Sanjay Chatterji
exaly
A derivative-based parser generator for visibly Pushdown grammars
2021Xiaodong Jia, Ashish Kumar, Gang Tan
exaly
P4-to-blockchain: A secure blockchain-enabled packet parser for software defined networking
Computers and Security, 2020Abbas Yazdinejad +2 more
exaly
Parser description-based bitstream parser generation for MPEG RMC framework
Signal Processing: Image Communication, 2013Seungwook Lee, Euee S Jang
exaly

