Theodore Norvell <[EMAIL PROTECTED]> wrote,
> The way I'm doing this is to use XMLLib's parser to create a tree
> (a "document object") and then using a parsing monad to "reparse" the tree
> of strings into a full abstract syntax tree. Since most combinator parser
> systems and monadic parser systems expect their inputs to be strings rather
> than lists of trees, I had to write my own Monad; but that
> wasn't so hard.
The compiler toolkit's parser combinators do require merely
that the elements in the input list are an instance of the
`Token' type class[1]:
class (Pos t, Show t, Eq t, Ord t) => Token t
So, as far as I see, they should be usable for implementing
the reparsing.
Cheers,
Manuel
[1] I think, Doitse does something similar.
