[Haskell-cafe] Do you want to maintain bindings-DSL?
Hi, bindings-DSL[1] is a stable and reliable macro package for FFI. It just got a new tutorial and its repository is now in git. If no one else wants to maintain it, I'll still be looking at issue reports and fixing possible problems, but I've not been actively using Haskell for some time, and won't add anything new or make plans for future changes. The original idea behind bindings-DSL was to build a wide set of community maintained raw bindings to interesting C libraries, on which Haskell programmers could safely depend when creating their own higher level packages. Although that idea never really took off, bindings-DSL itself got some popularity, probably because it makes instancing Storable easy. If you want to take maintenance, you have some options. You could just kill the bindings-* idea and add some flexibility to new macros, which I always avoided to enforce consistency. Or you could keep the original goal, and maybe add a mailing list and a web page where users could request new libraries and discuss solutions to trick issues. A possible plan for version 2 is to be independent of hsc2hs, and use a new syntax instead of C macros. Thanks. Best, Maurício [1]: http://bitbucket.org/mauricio/bindings-dsl ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] video for linux two (v4l2) bindings
Hi, all, I've added that 'extra-libraries' to .cabal, and also modules for fcntl.h and sys/mman.h (mmap). Would you please test it and check if it solves the problem before I upload it to hackage? https://bitbucket.org/mauricio/bindings-dsl/downloads/bindings-posix-1.2.3.tar.gz Just download from that link, unpack and do 'cabal install' inside the new directory. Best, Maurício 2011/7/8, Claude Heiland-Allen : > Hi, > > On 05/07/11 10:19, Christopher Done wrote: > [snip] >> /usr/bin/ld: >> /home/chris/.cabal/lib/bindings-posix-1.2.2/ghc-6.12.3/libHSbindings-posix-1.2.2.a(Signal.o):(.text+0x5dfb): >> error: undefined reference to 'pthread_kill' > [snip] >> I guess on Claude's system it's linked to by default. So for guys >> trying the examples with that error I'd recommend the following >> commandline: >> >>cabal install v4l2-examples --ghc-option=-lpthread > > I think this could be a bug in bindings-posix (maintainer CC'd), I guess > it could do with this in its .cabal file: > > Extra-libraries: pthread > >> Can't really play about with the webcam right now but I'd had a small >> but cool project I've had in mind for a while that v4l is perfectly >> suited for, so I'll get back to you with my experiences. Thanks for >> releasing it, Claude. :-) > > Cool, look forward to seeing it! Hopefully I'll soon find time to > upload to Hackage a preliminary (feature-incomplete) release of the > higher-level interface that I'm working on; until then: > https://gitorious.org/hsv4l2/v4l2 > > > Claude > -- > http://claudiusmaximus.goto10.org > ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] [Off-topic]Functional parsing theory
After reading your message I found "Why Attribute Grammars Matter" and a few other introductions, and it seems attribute grammars are exactly what I'm trying to do. Do you know of some place (mailing list etc.) where I can discuss attribute grammars or ask for suggestions on design? Thanks, Maurício 2010/10/7, bieniusa : > It's not entirely clear what you mean: > > Do you want to describe grammars or parsers functionally: > > In the first case, parser combinators are what you want (or some > encoding of them). There are many variations on these: LL(k), > context-free, dependent. Cyclicity (of what kind?) or empty productions > are not necessarily a problem. > > If you already parsed the input to an abstract syntax tree, and want to > act on this input in terms of your grammar, then attribute grammars are > what you are looking for. > > - Arie > > Am 06.10.2010 17:43, schrieb Maurício CA: >> Hi, all, >> >> I've been working in a tool that reads a grammar with associated >> actions and act on input based on that grammar. I would like to >> rewrite it in a functional style, but I've not been able to find a >> theory that would handle any possible grammar with cyclicity and >> empty productions, and flexibility is more important for this tool >> than performance. >> >> Do you have a suggestion on that? What I'm using now is this >> (non-functional) article on Earley method: >> >> http://www.springerlink.com/content/602270808666074p >> >> Thanks, >> >> Maurício >> >> ___ >> Haskell-Cafe mailing list >> Haskell-Cafe@haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe > > ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
