Browse thread
DSL for handling parsing binary memory structures?
-
Richard Jones
- Richard Jones
- Joel Reymont
- Gerd Stolpmann
- Jon Harrop
- Christian Lindig
- Markus Mottl
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2007-05-18 (07:41) |
From: | Christian Lindig <lindig@c...> |
Subject: | Re: [Caml-list] DSL for handling parsing binary memory structures? |
If you are interested in the research aspect of this, Kathleen Fisher did interesting work on parsing ad-hoc data (mostly ascii): http://www.research.att.com/~kfisher/hancock/release.php http://www.research.att.com/~kfisher/hancock/release.php I remember to have seen something like this for OCaml in the recent proceedings of ICFP or POPL but can't remember right now. My own work in the context of calling conventions proposes an algebra to describe structures in memory. This could be a starting point for a DSL; it is also implemented in the Quick C-- compiler (in OCaml) in module block.nw. http://www.st.cs.uni-sb.de/~lindig/papers/blocks/next.pdf http://www.cminusminus.org/rsync/qc--/src/block.nw -- Christian