This paper describes a new algorithm for top-down parsing of general context-free grammars. The algorithm does not require any changes to be made to the grammar, and can parse with respect to any grammar non-terminal as the start symbol. It is possible to generate all possible parse trees of the input string in the presence of ambiguous grammars. The algorithm reduces to recursive descent parsi...

This paper describes an Ei el system for rapid testing of grammars Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as additional an notations The actions are high level descriptions not procedural code to transform a parse tree into a syntax tree A parser producing a syntax tree for a language sentence can be automatically generated from ...

LMT (logic-based machine translation) is an experimental English-to-German MT system, being developed in the framework of logic programming. The English analysis uses a logic grammar formalism, Modular Logic Grammar, which allows logic grammars to be more compact, and which has a modular treatment of syntax, lexicon, and semantics. The English grammar is written independently of the task of tra...

Recent discussions of grammatical architectures have distinguished two competing approaches to the syntax-semantics interface: syntactocentrism, wherein syntactic structures are mapped or transduced to semantics (and phonology), vs. parallelism, wherein semantics (and phonology) communicates with syntax via a nondirectional (or relational) interface. This contrast arises for instance in dealing...

Our intention in this paper is to develop an explanatory account of the special characteristics of periphrastic expressions by refining the traditional notion of PARADIGM employed within inferential-realizational approaches to morphology (Anderson 1992, Aronoff 1994, Zwicky 1990, Stump 1993, 2001). Our proposal draws on this notion in order to develop a substantive reconceptualization of the fo...

English has become one of the compulsory subjects for students in China. As a foreign language, especially whose grammatical structure is, some sense, diverse from learners’ mother tongue, it requires teachers to research proper methods present syntactic patterns students’ sake. When turn linguistics, there are two well-known theories about syntax different points perspective. They transformati...

In this paper, I give an overview of an ongoing project which aims at building a full-scale computational grammar for Georgian in the Lexical Functional Grammar framework and try to illustrate both practical and theoretical aspects of grammar development. The rich and complex morphology of the language is a major challenge when building a computational grammar for Georgian that is meant to be m...

We present a new graph grammar based approach for defining the syntax of visual languages and for generating visual language parsers. Its main advantage  in comparison to other visual language parsing approaches  is its ability to handle context-sensitive productions which may replace more than one non-terminal at the same time and which may contain very complex context requirements. Its impl...