Sciweavers

9 search results - page 2 / 2
» Removing Left Recursion from Context-Free Grammars
Sort
View
TCS
2010
13 years 3 months ago
Left-forbidding cooperating distributed grammar systems
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
Filip Goldefus, Tomás Masopust, Alexander M...
ENTCS
2000
103views more  ENTCS 2000»
13 years 5 months ago
Combinator Parsers - From Toys to Tools
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left...
S. Doaitse Swierstra
NLPRS
2001
Springer
13 years 9 months ago
Incremental CFG Parsing with Statistical Lexical Dependencies
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
Takahisa Murase, Shigeki Matsubara, Yoshihide Kato...
GECCO
2009
Springer
173views Optimization» more  GECCO 2009»
13 years 12 months ago
Creating regular expressions as mRNA motifs with GP to predict human exon splitting
Low correlation between mRNA concentrations measured at different locations for the same exon show many current Ensembl exon definitions are incomplete. Automatically created pa...
William B. Langdon, Joanna Rowsell, Andrew P. Harr...