Sciweavers

273 search results - page 11 / 55
» Extensible Grammars for Language Specialization
Sort
View
CPP
2011
107views more  CPP 2011»
12 years 7 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
JOLLI
2006
101views more  JOLLI 2006»
13 years 7 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke
OOPSLA
2004
Springer
14 years 25 days ago
A language-independent approach to software maintenance using grammar adapters
A long-standing goal of software engineering is to construct software that is easily modified and extended. Recent advances in software design techniques, such as aspect-oriented ...
Suman Roychoudhury
ECOOP
1998
Springer
13 years 11 months ago
An Imperative, First-Order Calculus with Object Extension
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
Viviana Bono, Kathleen Fisher
ICGI
2010
Springer
13 years 8 months ago
Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
Alexander Clark