Sciweavers

LACL
2005
Springer
13 years 10 months ago
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
Peter Ljunglöf
CSMR
2005
IEEE
13 years 10 months ago
Towards the Automatic Evolution of Reengineering Tools
Building reverse engineering or reengineering tools often requires parsers for many different programming languages. The diffusion of dialects and variants makes many available pa...
Massimiliano Di Penta, Kunal Taneja
CICLING
2007
Springer
13 years 10 months ago
The Non-associativity of Polarized Tree-Based Grammars
Abstract. Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars...
Yael Cohen-Sygal, Shuly Wintner
CEC
2008
IEEE
13 years 11 months ago
Grammatical bias and building blocks in meta-grammar Grammatical Evolution
—This paper describes and tests the utility of a meta Grammar approach to Grammatical Evolution (GE). Rather than employing a fixed grammar as is the case with canonical GE, und...
Erik Hemberg, Michael O'Neill, Anthony Brabazon
MFCS
2009
Springer
13 years 11 months ago
Self-indexed Text Compression Using Straight-Line Programs
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
Francisco Claude, Gonzalo Navarro