268 search results - page 15 / 54 » Linear Context Free Languages |
FPL
2001
Springer
15 years 4 months ago
2001
Springer
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
COLT
1992
Springer
15 years 3 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
103
click to vote
ENTCS
2010
14 years 12 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
136
click to vote
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
LACL
2005
Springer
15 years 5 months ago
2005
Springer
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...