42,118 research outputs found
TuLiPA : towards a multi-formalism parsing environment for grammar engineering
In this paper, we present an open-source parsing environment (TĂĽbingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component Tree-Adjoining Grammars with Tree Tuples (TT-MCTAG)) and allows computation not only of syntactic structures, but also of the corresponding semantic representations. It is used for the development of a tree-based grammar for German
TuLiPA : towards a multi-formalism parsing environment for grammar engineering
In this paper, we present an open-source parsing environment (TĂĽbingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component Tree-Adjoining Grammars with Tree Tuples (TT-MCTAG)) and allows computation not only of syntactic structures, but also of the corresponding semantic representations. It is used for the development of a tree-based grammar for German
Graph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages
Graph Interpolation Grammars are a declarative formalism with an operational
semantics. Their goal is to emulate salient features of the human parser, and
notably incrementality. The parsing process defined by GIGs incrementally
builds a syntactic representation of a sentence as each successive lexeme is
read. A GIG rule specifies a set of parse configurations that trigger its
application and an operation to perform on a matching configuration. Rules are
partly context-sensitive; furthermore, they are reversible, meaning that their
operations can be undone, which allows the parsing process to be
nondeterministic. These two factors confer enough expressive power to the
formalism for parsing natural languages.Comment: 41 pages, Postscript onl
TuLiPA : a syntax-semantics parsing environment for mildly context-sensitive formalisms
In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semantic representations
Parsing for agile modeling
Agile modeling refers to a set of methods that allow for a quick initial development of an importer and its further refinement. These requirements are not met simultaneously by the current parsing technology. Problems with parsing became a bottleneck in our research of agile modeling.
In this thesis we introduce a novel approach to specify and build parsers. Our approach allows for expressive, tolerant and composable parsers without sacrificing performance. The approach is based on a context-sensitive extension of parsing expression grammars that allows a grammar engineer to specify complex language restrictions. To insure high parsing performance we automatically analyze a grammar definition and choose different parsing strategies for different parts of the grammar.
We show that context-sensitive parsing expression grammars allow for highly composable, tolerant and variable-grained parsers that can be easily refined. Different parsing strategies significantly insure high-performance of parsers without sacrificing expressiveness of the underlying grammars
IEAD: A Novel One-Line Interface to Query Astronomical Science Archives
In this article I present IEAD, a new interface for astronomical science
databases. It is based on a powerful, yet simple, syntax designed to completely
abstract the user from the structure of the underlying database. The
programming language chosen for its implementation, JavaScript, makes it
possible to interact directly with the user and to provide real-time
information on the parsing process, error messages, and the name resolution of
targets; additionally, the same parsing engine is used for context-sensitive
autocompletion. Ultimately, this product should significantly simplify the use
of astronomical archives, inspire more advanced uses of them, and allow the
user to focus on what scientific research to perform, instead of on how to
instruct the computer to do it.Comment: 13 pages, PASP in pres
One Parser to Rule Them All
Despite the long history of research in parsing, constructing parsers for real programming languages remains a difficult and painful task. In the last decades, different parser generators emerged to allow the construction of parsers from a BNF-like specification. However, still today, many parsers are handwritten, or are only partly generated, and include various hacks to deal with different peculiarities in programming languages. The main problem is that current declarative syntax definition techniques are based on pure context-free grammars, while many constructs found in programming languages require context information.
In this paper we propose a parsing framework that embraces context information in its core. Our framework is based on data-dependent grammars, which extend context-free grammars with arbitrary computation, variable binding and constraints. We present an implementation of our framework on top of the Generalized LL (GLL) parsing algorithm, and show how common idioms in syntax of programming languages such as (1) lexical disambiguation filters, (2) operator precedence, (3) indentation-sensitive rules, and (4) conditional preprocessor directives can be mapped to data-dependent grammars. We demonstrate the initial experience with our framework, by parsing more than 20000 Java, C#, Haskell, and OCaml source files
Parsing Based on Scattered Context Grammars
Tato práce se zabĂ˝vá novĂ˝mi moĹľnostmi pĹ™ekladu na základÄ› pokroÄŤilĂ˝ch formálnĂch modelĹŻ. KonkrĂ©tnÄ› vyuĹľitĂm gramatik s rozptĂ˝lenĂ˝m kontextem v syntaktickĂ© analĂ˝ze. Byl vytvoĹ™en kontextovĂ˝ jazyk, na kterĂ©m jsou porovnávány dvÄ› vybranĂ© metody syntaktickĂ© analĂ˝zy, kde jsou tyto gramatiky vyuĹľĂvány. ZávÄ›rem je diskutováno moĹľnĂ© vyuĹľitĂ v praxi, paralelnĂ analĂ˝za, vĂ˝hody, nevĂ˝hody a moĹľnĂ˝ dalšà vĂ˝voj.This work deals with new possibilities in parsing based on advanced formal models, specifically using scattered context grammars in syntactic analysis. Context-sensitive language was created for comparing different methods of syntactic analysis, where these grammars are used. In conclusion is discussed possible use in practise, paralell parsing, pros and cons and further investigation.
- …