Results 321 to 330 of about 179,036 (364)
Some of the next articles are maybe not open access.
DR parsers: a generalization of LR parsers
Proceedings of the 1990 IEEE Workshop on Visual Languages, 2002A 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 +3 more sources
Proceedings of the 1992 ACM conference on LISP and functional programming, 1992
We present the operational semantics of streams and stream matching as discussed in. Streams are data structures such as lists, but with different primitive operations. Streams not only provide an interface to usual imput/output channels, but may used as a data structure per se , holding any kind of element.
Michel Mauny, Daniel de Rauglaudre
openaire +2 more sources
We present the operational semantics of streams and stream matching as discussed in. Streams are data structures such as lists, but with different primitive operations. Streams not only provide an interface to usual imput/output channels, but may used as a data structure per se , holding any kind of element.
Michel Mauny, Daniel de Rauglaudre
openaire +2 more sources
A Generalized Earley Parser for Human Activity Parsing and Prediction
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020Detection, parsing, and future predictions on sequence data (e.g., videos) require the algorithms to capture non-Markovian and compositional properties of high-level semantics.
Siyuan Qi +4 more
semanticscholar +1 more source
Building a Semantic Parser Overnight
Annual Meeting of the Association for Computational Linguistics, 2015How do we build a semantic parser in a new domain starting with zero training examples? We introduce a new methodology for this setting: First, we use a simple grammar to generate logical forms paired with canonical utterances.
Yushi Wang, Jonathan Berant, Percy Liang
semanticscholar +1 more source
Natural Language Engineering, 1998
This paper deals with the development of parsing techniques for the analysis of natural language sentences. We present a paradigm of a multi- path shift-reduce parser which combines two differently structured computational subsystems. The first uses information concerning native speakers' preferences, and the second deals with the linguistic ...
Anthony Draggiotis +2 more
openaire +2 more sources
This paper deals with the development of parsing techniques for the analysis of natural language sentences. We present a paradigm of a multi- path shift-reduce parser which combines two differently structured computational subsystems. The first uses information concerning native speakers' preferences, and the second deals with the linguistic ...
Anthony Draggiotis +2 more
openaire +2 more sources
Total parser combinators [PDF]
ACM SIGPLAN Notices, 2010 A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is similar to those of many other parser combinator libraries, with two important differences: one is that the interface clearly specifies which parts of the constructed parsers may be ...
openaire +1 more source
Multibox parsers: no more handwritten lexical parsers
IEEE Software, 1995Most 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 +2 more sources
ACM SIGLASH Newsletter, 1979
Recent parsers have extended the variety and difficulty of natural language constructs recognizable by a computer. However, one shortcoming of existing parsers is that as the complexity of the sentences recognized increases, the computational complexity increases quadratically. One reason for this computational explosion is that much if not most of the
Jeffrey F. Eastman, Alan L. Tharp
openaire +2 more sources
Recent parsers have extended the variety and difficulty of natural language constructs recognizable by a computer. However, one shortcoming of existing parsers is that as the complexity of the sentences recognized increases, the computational complexity increases quadratically. One reason for this computational explosion is that much if not most of the
Jeffrey F. Eastman, Alan L. Tharp
openaire +2 more sources
Mison: A Fast JSON Parser for Data Analytics
Proceedings of the VLDB Endowment, 2017The growing popularity of the JSON format has fueled increased interest in loading and processing JSON data within analytical data processing systems. However, in many applications, JSON parsing dominates performance and cost. In this paper, we present a
Yinan Li +4 more
semanticscholar +1 more source
ACM SIGSOFT Software Engineering Notes, 1994
Traditional compiler front end generating tools such as Lex/Yacc assume a front end consisting of two boxes: a lexical box and a syntax box. Lex produces a lexical analyzer using regular expressions as a token description. Yacc generates a syntax analyzer from the LALR grammar for the parsed language.
openaire +3 more sources
Traditional compiler front end generating tools such as Lex/Yacc assume a front end consisting of two boxes: a lexical box and a syntax box. Lex produces a lexical analyzer using regular expressions as a token description. Yacc generates a syntax analyzer from the LALR grammar for the parsed language.
openaire +3 more sources