Results 261 to 270 of about 27,995 (314)

DR parsers: a generalization of LR parsers

Proceedings of the 1990 IEEE Workshop on Visual Languages, 2002
A method is presented to construct a parser for a visual language whose specification can be done by a context-free grammar. The main idea is to allow a traditional LR parser to choose the next symbol to parse from a two-dimensional space. The positional grammar is defined, and some examples are given.
Costagliola G., Chang S. K.
openaire   +2 more sources

Parser-directed fuzzing

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019
To be effective, software test generation needs to well cover the space of possible inputs. Traditional fuzzing generates large numbers of random inputs, which however are unlikely to contain keywords and other specific inputs of non-trivial input languages.
Mathis, Björn   +5 more
openaire   +1 more source

EfficientLR (1) parsers

Acta Informatica, 1973
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire   +2 more sources

Incremental LR parsers

Acta Informatica, 1978
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire   +3 more sources

Multibox parsers: no more handwritten lexical parsers

IEEE Software, 1995
Most parser generators do not work with lexically complex languages like Fortran. Compiler writers end up writing lexers by hand. To deal with this complexity, the author suggests generating a parser that uses a series of boxes-like a mechanical caterpillar-instead of just two. >
openaire   +1 more source

LD-Parser

Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control, 2019
Dependency parsing is one of the basic research of natural language processing. In recent years, transition-based and graph-based methods have been used widely, but there are still some problems such as feature limitation and high time complexity. In this paper, we proposed a new method named Leaf Detection based Dependency Parsing (LD-Parser), which ...
Weidong Wen   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy