Sciweavers

376 search results - page 12 / 76
» Grammar Development in GF
Sort
View
CALCO
2009
Springer
141views Mathematics» more  CALCO 2009»
14 years 3 months ago
Unfolding Grammars in Adhesive Categories
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
APLAS
2006
ACM
14 years 2 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
OOPSLA
2005
Springer
14 years 2 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed
CISSE
2008
Springer
13 years 10 months ago
Testing Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as "Specifications for defining languages or compilers". They form the basics of languages and ...
A. M. Paracha, F. Franek
ACL
1993
13 years 10 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