conc
File
|
conc.str
|
Author
|
unknown
|
Since
|
unknown
|
Conc to Cons
SDF2 lists are composed by means of a binary concatenationoperator (\verb|A+ A+ -> A+|) that we translated to\verb|Conc| above. In abstract syntax trees we want torepresent lists by \verb|Cons/Nil| structures. The followingrules achieve this transformation.
Note: these strategies are not used in the main implode-asfix.
Statistics
General
|
Lines of code
|
40
|
Stratego
|
Module number
|
1 (100% documented)
|
Constructor number
|
4 (25% documented)
|
Overlay number
|
0
|
Strategy number
|
1 (0% documented)
|
Rule number
|
12 (0% documented)
|
DynamicRule number
|
0
|
Strategy summary
|
conc-to-cons
|
n/a
|
conc.str
|
Constructor details
|
|
Snoc(ATerm , ATerm )
|
File
|
conc.str
|
Author
|
unknown
|
Since
|
unknown
|
|
No information available.
todo
|
Where is this Snoc coming from?
|
|
|