Sciweavers

ECML
2000
Springer
13 years 8 months ago
Learning Context-Free Grammars with a Simplicity Bias
We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a rational reconstruction of Wol 's SNPR { the Gridssys...
Pat Langley, Sean Stromsten
SCAM
2002
IEEE
13 years 8 months ago
Grammar Programming in TXL
Syntactic analysis forms a foundation of many source analysis and reverse engineering tools. However, a single grammar is not always appropriate for all source analysis and manipu...
Thomas R. Dean, James R. Cordy, Andrew J. Malton, ...
WIA
2007
Springer
13 years 9 months ago
Analyzing Ambiguity of Context-Free Grammars
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
Claus Brabrand, Robert Giegerich, Anders Mø...
IWPC
2008
IEEE
13 years 10 months ago
The Reuse of Grammars with Embedded Semantic Actions
Reusing syntax specifications without embedded arbitrary semantic actions is straightforward because the semantic analysis phases of new applications can feed off trees or other ...
Terence Parr
MFCS
2009
Springer
13 years 10 months ago
Synchronization of Regular Automata
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
Didier Caucal
CIARP
2009
Springer
13 years 10 months ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales