2372 search results - page 77 / 475 » Probabilistic calling context |
FPL
2001
Springer
14 years 2 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...
UIST
1999
ACM
14 years 2 months ago
1999
ACM
Diagram manipulation in conventional CAD systems requires frequent mode switching and explicit placement of the pivot for rotation and scaling. In order to simplify this process, ...
COLT
1992
Springer
14 years 2 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...
CAAP
1994
14 years 1 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
LICS
1991
IEEE
14 years 1 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...