10 search results - page 1 / 2 » Tabular Parsing |
ACL
1998
13 years 6 months ago
1998
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to pure...
GRAMMARS
2000
13 years 4 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
ACL
1994
13 years 6 months ago
1994
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular alg...
FPL
2001
Springer
13 years 9 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...
CORR
2004
Springer
13 years 4 months ago
2004
Springer