Sciweavers

487 search results - page 86 / 98
» Code Composition as an Implementation Language for Compilers
Sort
View
POPL
2010
ACM
14 years 5 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
EUROMICRO
2000
IEEE
14 years 2 days ago
Concurrent Control Systems: From Grafcet to VHDL
The Automated Production Systems (APS) are composed of concurrent interacting entities. Then any model should exhibit parallel and sequential behaviours. The Grafcet is now well e...
Frédéric Mallet, Daniel Gaffé...
ICALP
1990
Springer
13 years 11 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...
PLDI
2000
ACM
13 years 11 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra
RIA
2007
123views more  RIA 2007»
13 years 7 months ago
Continuations pour la programmation de comportement d'agent
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
Denis Jouvin