212 search results - page 5 / 43 » Second-Order Simple Grammars |
103
Voted
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
103
Voted
WIA
2007
Springer
15 years 7 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
171
Voted
CSLP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Exten...
108
Voted
OOPSLA
2010
Springer
14 years 11 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
84
Voted
ACL
2010
14 years 11 months ago
2010
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...