212 search results - page 11 / 43 » Second-Order Simple Grammars |
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store an...
PODS
2004
ACM
15 years 10 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
ACL
1998
14 years 11 months ago
1998
Finding simple, non-recursive, base noun phrases is an important subtask for many natural language processing applications. While previous empirical methods for base NP identifica...
526
click to vote
Book
"Bison is a general-purpose parser generator that converts an annotated context-free grammar
into an LALR(1) or GLR parser for that grammar. Once you are proficient with Biso...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...