5 search results - page 1 / 1 » Modularizing Codescriptive Grammars for Efficient Parsing |
85
Voted
COLING
1996
15 years 2 months ago
1996
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
116
Voted
GRAMMARS
2000
15 years 28 days 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...
96
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
117
Voted
AI
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
121
Voted
TSE
2008
15 years 1 months ago
2008
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...