Sciweavers

382 search results - page 23 / 77
» Generalized Multitext Grammars
Sort
View
COLING
2000
13 years 8 months ago
Parsing Schemata for Grammars with Variable Number and Order of Constituents
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
Karl-Michael Schneider
ACL
1993
13 years 8 months ago
A Unification-Based Parser for Relational Grammar
We present an implemented unification-based parser for relational grammars developed within the stratified feature grammar (SFG) framework, which generalizes Kasper-Rounds logic t...
David E. Johnson, Adam Meyers, Lawrence S. Moss
ENTCS
2008
78views more  ENTCS 2008»
13 years 7 months ago
Silver: an Extensible Attribute Grammar System
Attribute grammar specification languages, like many domain specific languages, offer significant advantages to their users, such as high-level declarative constructs and domain-s...
Eric Van Wyk, Derek Bodin, Jimin Gao, Lijesh Krish...
CC
1994
Springer
13 years 11 months ago
Flow Grammars - a Flow Analysis Methodology
: Flow grammars provide a new mechanism for modelling control flow in flow analyzers and code optimizers. Existing methods for representing control flow are inadequate in terms of ...
James S. Uhl, R. Nigel Horspool
ISIM
2007
13 years 8 months ago
k-Limited Erasing Performed by Scattered Context Grammars
A scattered context grammar, G, erases nonterminals in a k-limited way, where k ≥ 1, if in every sentential form of any derivation, between every two symbols from which G derive...
Jirí Techet