Modular Logic Grammars

نویسنده

  • Michael C. McCord
چکیده

This report describes a logic grammar formalism, Modular Logic Grammars, exhibiting a high degree of modularity between syntax and semantics. There is a syntax rule compiler (compiling into Prolog) which takes care of the building of analysis structures and the interface to a clearly separated semantic interpretation component dealing with scoping and the construction of logical forms. The whole system can work in either a one-pass mode or a two-pass mode. [n the one-pass mode, logical forms are built directly during parsing through interleaved calls to semantics, added automatically by the rule compiler. [n the two-pass mode, syntactic analysis trees are built automatically in the first pass, and then given to the (one-pass) semantic component. The grammar formalism includes two devices which cause the automatically built syntactic structures to differ from derivation trees in two ways: [I) There is a shift operator, for dealing with left-embedding constructions such as English possessive noun phrases while using rightrezursive rules (which are appropriate for Prolog parsing). (2) There is a distinction in the syntactic formalism between strong non-terminals and weak non-terminals, which is important for distinguishing major levels of grammar.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

Modular and Efficient Top-Down Parsing for Ambiguous Left-Recursive Grammars

In functional and logic programming, parsers can be built as modular executable specifications of grammars, using parser combinators and definite clause grammars respectively. These techniques are based on top-down backtracking search. Commonly used implementations are inefficient for ambiguous languages, cannot accommodate left-recursive grammars, and require exponential space to represent par...

متن کامل

Self-Reconfiguration Using Graph Grammars for Modular Robotics

In this paper, we apply graph grammars to self-reconfigurable modular robots and present a method to reconfigure arbitrary initial configurations into prespecified target configurations thus connecting the motions of modules to formal assembly rules. We present an approach for centralized reconfiguration planning and decentralized, rule-based reconfiguration execution for three-dimensional modu...

متن کامل

LMT: A PROLOG-Based Machine Translation System

Analysis of the source is essentially independent of the task of translation, and in fact the very same English grammar used in LMT is also used in an English data base query system. Analysis is based on a logic grammar formalism, Modular Logic Grammars (MLG’s) (McCord, 1985). MLG’s have clearly separated syntactic, lexical, and semantic components. Furthermore, syntactic structure building is ...

متن کامل

Modular Well-Definedness Analysis for Attribute Grammars

Extension developers deal with errors User has no conflict errors The full solution consists of: Forwarding Van Wyk. de Moor. Backhouse. Kwiathowski. "Forwarding in attribute grammars for modular language design." CC '02 Copper's modular analysis for syntax Schwerdfeger. Van Wyk. "Verifiable composition of deterministic grammars." PLDI '09 Silver's modular analysis for semantics Kaminski. Van W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1985