First question. As I saw in sources, both hxt and haxml uses [Char]'s. this is very inefficient. I want to know, does any effective parser for haskell, written in haskell, exists. Efficient means using ByteString to store strings and possibly building representations that shares one string for all similiary named elements. If there is no, is anyone interested in writing one? Second question. I'd like to have a package for read-write-edit SVG graphics. I think, xslt (both transformations and formatting object) are interesting too. Is anyone considering writing such packages?
On Tue, 9 Nov 2010, Permjacov Evgeniy wrote:
First question. As I saw in sources, both hxt and haxml uses [Char]'s. this is very inefficient. I want to know, does any effective parser for haskell, written in haskell, exists. Efficient means using ByteString to store strings and possibly building representations that shares one string for all similiary named elements. If there is no, is anyone interested in writing one?
ByteString would be only useful for (undecoded) input. XML identifiers and text have to be Unicode, thus the 'text' library could be a replacement for String. In the pre-'text' era I tried to use ByteString as input and String for XML identifiers and text and got no significant speedup.
Second question. I'd like to have a package for read-write-edit SVG graphics. I think, xslt (both transformations and formatting object) are interesting too. Is anyone considering writing such packages?
It would be nice. We already have HPDF for PDF construction and hps for PostScript construction and cairo for construction of PDF, PS, SVG.
You might want to consider SVG only as an output format. As a graphics format it is very baroque with many special cases and sundry obscure corners. If you like grand challenges, round-tripping SVG might be interesting. Unfortunately this would likely consume all the effort that you would otherwise want to spend on actual graphics.
First question. As I saw in sources, both hxt and haxml uses [Char]'s. this is very inefficient. I want to know, does any effective parser for haskell, written in haskell, exists.
The TagSoup parser can generate ByteString syntax trees - but they're quite a bit slower than [Char] versions. I am planning to speed up the ByteString version in the future: http://code.google.com/p/ndmitchell/issues/detail?id=290
Efficient means using ByteString to store strings and possibly building representations that shares one string for all similiary named elements. If there is no, is anyone interested in writing one?
I intend to do that in TagSoup, and it can even be done now by running a Map state over the available strings with fmap. Thanks, Neil
participants (4)
-
Henning Thielemann -
Neil Mitchell -
Permjacov Evgeniy -
Stephen Tetley