30,536 research outputs found
Efficient Normal-Form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple
n-word sentence can have exponentially many parses. Generating all parses is
inefficient and obscures whatever true semantic ambiguities are in the input.
This paper addresses the problem for a fairly general form of Combinatory
Categorial Grammar, by means of an efficient, correct, and easy to implement
normal-form parsing technique. The parser is proved to find exactly one parse
in each semantic equivalence class of allowable parses; that is, spurious
ambiguity (as carefully defined) is shown to be both safely and completely
eliminated.Comment: 8 pages, LaTeX packaged with three .sty files, also uses cgloss4e.st
A Grammatical Paradigm
Avram Noam Chomsky is known for his work at Massachusetts Institute of Technology, for his political pursuits, and most importantly, for his theories in the discipline of linguistics. Chomsky linguistic pursuits aimed to answer the following linguistic studies: how a person learns and develops a language, how a person structures and understands a sentence, and what the purpose of linguistics is as a whole. His theories dramatically changed the linguistic paradigm. Due to this change, this paper also attempts to illustrate the correlation between scientific philosopher Thomas Kuhnâs belief in âparadigm shiftsâ and the subsequent change in linguistic thought spurred by Chomskyâs grammatical theories
Pattern matching in compilers
In this thesis we develop tools for effective and flexible pattern matching.
We introduce a new pattern matching system called amethyst. Amethyst is not
only a generator of parsers of programming languages, but can also serve as an
alternative to tools for matching regular expressions.
Our framework also produces dynamic parsers. Its intended use is in the
context of IDE (accurate syntax highlighting and error detection on the fly).
Amethyst offers pattern matching of general data structures. This makes it a
useful tool for implementing compiler optimizations such as constant folding,
instruction scheduling, and dataflow analysis in general.
The parsers produced are essentially top-down parsers. Linear time complexity
is obtained by introducing the novel notion of structured grammars and
regularized regular expressions. Amethyst uses techniques known from compiler
optimizations to produce effective parsers.Comment: master thesi
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes
We study cooperating distributed grammar systems working in hybrid modes in
connection with the finite index restriction in two different ways: firstly, we
investigate cooperating distributed grammar systems working in hybrid modes
which characterize programmed grammars with the finite index restriction;
looking at the number of components of such systems, we obtain surprisingly
rich lattice structures for the inclusion relations between the corresponding
language families. Secondly, we impose the finite index restriction on
cooperating distributed grammar systems working in hybrid modes themselves,
which leads us to new characterizations of programmed grammars of finite index.Comment: In Proceedings AFL 2014, arXiv:1405.527
- âŠ