Strafunski

Strafunski is a functional programming-based toolset for implementing program analysis and transformation components. It is implemented in Haskell, and provides an API for operating on parse trees such as those generated by SDF. ^[1]

Features:

Generic traversal over typed representations of parse trees
integration with external components

External links

ASF+SDF Meta Environment

Related Material

↑ R. Lammel and J. Visser, A Strafunski Application Letter, PADL'03, Springer-Verlag

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

This box: [[{{Expansion depth limit exceeded|#default = {{Expansion depth limit exceeded}}

|{{Expansion depth limit exceeded}} = 
   {{Expansion depth limit exceeded| {{Expansion depth limit exceeded}}
     | Template:{{{Expansion depth limit exceeded}}}            
     | {{Expansion depth limit exceeded}}      
   }}

}}|view]] • [[|talk]] • [{{Expansion depth limit exceeded|action=edit}}{{Expansion depth limit exceeded|e|edit}}]

If you like SEOmastering Site, you can support it by - BTC: bc1qppjcl3c2cyjazy6lepmrv3fh6ke9mxs7zpfky0 , TRC20 and more...

→

[1] R. Lammel and J. Visser, A Strafunski Application Letter, PADL'03, Springer-Verlag

[1]

Strafunski

See also

External links

Related Material

Navigation menu

Page actions

Page actions

Personal tools

Navigation

Search

Seo Tools

Tools

Main Categories