155
click to vote
ECML
2000
Springer
15 years 10 months ago
2000
Springer
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...
154
click to vote
SCAM
2002
IEEE
15 years 11 months ago
2002
IEEE
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...
149
click to vote
WIA
2007
Springer
16 years 2 days ago
2007
Springer
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...
154
click to vote
IWPC
2008
IEEE
16 years 11 days 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 ...
132
click to vote
MFCS
2009
Springer
16 years 15 days ago
2009
Springer
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...
160
click to vote
CIARP
2009
Springer
16 years 16 days ago
2009
Springer
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...