I don't think Template Haskell will be essential for this - you will probably need a parser (probably written with Parsec), an eval function, and a state monad to represent imperative changes made by the language you're evaluating. Template Haskell is more for the elimination of boilerplate code or turning specs into compile-time constraints.
On Thursday Aug 19, 2010, at 11:05 PM, Michael Litchard wrote: > I'd like the community to give me feedback on the difficulty level of > implementing an awk interpreter. What language features would be > required? Specifically I'm hoping that TH is not necessary because I'm > nowhere near that skill level. > > > An outline of a possible approach would be appreciated. I am using > http://www.math.utah.edu/docs/info/gawk_toc.html > as a guide to the language description. > _______________________________________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
