| Copyright | (c) 2014 Patrick Bahr, Emil Axelsson |
|---|---|
| License | BSD3 |
| Maintainer | Patrick Bahr <paba@di.ku.dk> |
| Stability | experimental |
| Portability | non-portable (GHC Extensions) |
| Safe Haskell | None |
| Language | Haskell98 |
Data.Comp.Dag.AG
Description
This module implements the recursion schemes from module
Data.Comp.AG on Dags. In order to deal with the sharing present
in Dags, the recursion schemes additionally take an argument of
type d -> d -> d that resolves clashing inherited attribute
values.
- runAG :: forall f d u. Traversable f => (d -> d -> d) -> Syn' f (u, d) u -> Inh' f (u, d) d -> (u -> d) -> Dag f -> u
- runRewrite :: forall f g d u. (Traversable f, Traversable g) => (d -> d -> d) -> Syn' f (u, d) u -> Inh' f (u, d) d -> Rewrite f (u, d) g -> (u -> d) -> Dag f -> (u, Dag g)
Documentation
Arguments
| :: Traversable f | |
| => (d -> d -> d) | resolution function for inherited attributes |
| -> Syn' f (u, d) u | semantic function of synthesised attributes |
| -> Inh' f (u, d) d | semantic function of inherited attributes |
| -> (u -> d) | initialisation of inherited attributes |
| -> Dag f | input dag |
| -> u |
This function runs an attribute grammar on a dag. The result is the (combined) synthesised attribute at the root of the dag.
Arguments
| :: (Traversable f, Traversable g) | |
| => (d -> d -> d) | resolution function for inherited attributes |
| -> Syn' f (u, d) u | semantic function of synthesised attributes |
| -> Inh' f (u, d) d | semantic function of inherited attributes |
| -> Rewrite f (u, d) g | initialisation of inherited attributes |
| -> (u -> d) | input term |
| -> Dag f | |
| -> (u, Dag g) |
This function runs an attribute grammar with rewrite function on a dag. The result is the (combined) synthesised attribute at the root of the dag and the rewritten dag.