GF (Grammatical Framework) is a grammar formalism based on the distinction between abstract and concrete syntax. An abstract syntax is a free algebra of trees, and a concrete syntax is a mapping from trees to nested records of strings and features. These mappings are naturally defined as functions in a functional programming language; the GF language provides the customary functional programmin...

This article is concerned with the question as to whether the components of grammar (syntax, semantics and phonology) have a similar architecture. I provide a modest historical background to the recurrent discussion about the parallelisms between syntax and phonology within Generative Grammar and mention some ‘meta-patterns’, i.e., shared properties of linguistic structures in different modules...

We present a class-based approach to building a verb lexicon that makes explicit the close relation between syntax and semantics for Levin classes. We have used a Lexicalized Tree Adjoining Grammar to capture the syntax associated with each verb class and have added semantic predicates to each tree, which allow for a compositional interpretation.

As an approach to syntax based statistical machine translation (SMT), Probabilistic Synchronous Dependency Insertion Grammars (PSDIG), introduced in (Ding and Palmer, 2005), are a version of synchronous grammars defined on dependency trees. In this paper we discuss better learning and decoding algorithms for a PSDIG MT system. We introduce two new grammar learners: (1) an exhaustive learner com...

This report presents a concrete grammar for the formal software speciication language Z, based on the BNF-like syntax description in the widely used Z Reference Manual. It has been used as a starting point for several projects associated with Z. The grammar is written in the format required for the public domain compiler-compiler PRECC. It has also been used as a basis for grammars aimed at oth...

This paper presents ongoing work dedicated to parsing the textual structure of procedural texts. This work is based on a two level approach: first, basic structures in texts are segmented using automata techniques and then a text grammar is applied to assemble these fragments. The grammar is based on X-bar syntax, transposed to text structure.

An algebraic approach to address the problem of generating prettyprinters is described. An algebraic prettyprint generator is deened which produces an algebraic prettyprinter for a language given its context-free grammar. Adaptation of the generated prettyprinter is possible by customizing the generated prettyprint rules. The prettyprinter transforms the abstract syntax tree of the text to be p...

According to the UML Standard 2.0 class and sequence diagrams are defined in a descriptive way by a MOF meta-model and semi-formal constraints. This paper presents a formal and constructive definition of the abstract syntax of UML class and sequence diagrams based on the well-defined theory of typed attributed graph transformation with inheritance and application conditions. The generated langu...

When implementing textual languages, formal grammars are commonly used to facilitate understanding languages and creating parsers. In the implementation of a diagrammatic visual programming language (VPL), this rarely happens, though graph grammars with their well– established theoretical background may be used as a natural and powerful syntax–definition formalism. Yet all graph grammar parsing...

Recent thought on grammatical architectures have underlined some discriminating features of the syntax-semantics interface: their syntactocentric nature when syntactic structures are mapped or transduced to semantics (and phonology); or their parallel nature, when semantics (and phonology) communicates with syntax via a nondirectional (or relational) interface. This duality arises for instance ...