Sciweavers

333 search results - page 29 / 67
» Grammar Programming in TXL
Sort
View
DLS
2008
213views Languages» more  DLS 2008»
13 years 10 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
GECCO
2000
Springer
158views Optimization» more  GECCO 2000»
14 years 7 days ago
Grammar based function definition in Grammatical Evolution
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the fu...
Michael O'Neill, Conor Ryan
CORR
2000
Springer
133views Education» more  CORR 2000»
13 years 8 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
ENTCS
2008
95views more  ENTCS 2008»
13 years 8 months ago
An Experimental Ambiguity Detection Tool
Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules. Whether these...
Sylvain Schmitz
STACS
2005
Springer
14 years 2 months ago
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
Kousha Etessami, Mihalis Yannakakis