Sciweavers

905 search results - page 46 / 181
» Parsing of Context-Sensitive Languages
Sort
View
CPP
2011
107views more  CPP 2011»
13 years 9 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
POPL
2004
ACM
15 years 10 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
POPL
2010
ACM
15 years 7 months ago
Semantics and Algorithms for Data-dependent Grammars
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...
Yitzhak Mandelbaum, Trevor Jim, David Walker
NLPRS
2001
Springer
15 years 2 months ago
Resolving Ambiguity in Inter-chunk Dependency Parsing
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency gr...
Mi-Young Kim, Sin-Jae Kang, Jong-Hyeok Lee
DLS
2010
204views Languages» more  DLS 2010»
14 years 8 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...