1064 search results - page 9 / 213 » Single Tree Grammars |
IWPC
2008
IEEE
14 years 1 months ago
2008
IEEE
Reusing syntax specifications without embedded arbitrary semantic actions is straightforward because the semantic analysis phases of new applications can feed off trees or other ...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
GRAMMARS
2000
13 years 7 months ago
2000
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
EACL
1989
ACL Anthology
13 years 8 months ago
1989
ACL Anthology
This paper describes some of the features of a sophisticated language and environment designed for experimentation with unification-oriented linguistic descriptions. The system, w...
TOOLS
1992
IEEE
13 years 11 months ago
1992
IEEE
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 add...