Sciweavers

333 search results - page 35 / 67
» Grammar Programming in TXL
Sort
View
APLAS
2003
ACM
14 years 9 days ago
Resource Usage Verification
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
Kim Marriott, Peter J. Stuckey, Martin Sulzmann
ICFP
2003
ACM
14 years 8 months ago
Polish parsers, step by step
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...
R. John M. Hughes, S. Doaitse Swierstra
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
14 years 1 months ago
Explaining and Controlling Ambiguity in Dynamic Programming
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Robert Giegerich
SAC
2000
ACM
14 years 6 days ago
An Approach for Modeling the Name Lookup Problem in the C++ Programming Language
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
James F. Power, Brian A. Malloy
SCCC
1998
IEEE
14 years 27 days ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...