There is no need for "." or [^abc] as Haskell list operators
can be used to "simulate" them. The following is from the C
lexer and matches all visible characters and all characters
except newline, respectively:
visible = alt [' '..'\127']
anyButNL = alt (['\0'..'\255'] \\
I think it would be useful if you could post the reparser stuff.
I think it would be really cool if we could parse the xml in a lazy fashion
so that the entire tree might not come into memory at once.
i.e.
let x=parse xml
in
(y,z)=processXml(someAlgebra,x)
like the circular rep-min
