[LAD] Prototyping algorithms and ideas

Albert Graef Dr.Graef at t-online.de
Fri Feb 1 18:45:19 UTC 2008


Kjetil S. Matheussen wrote:
> The last sentence was extremely bad formulated. I ment that
> the syntax for accessing faust needs to be different, because
> programming in snd is s-expressions based.

So what you need is an unparser for s-expressions that produces Faust's
infix syntax, this shouldn't be hard.

> This whole operation shouldn't take more than a few ms.

Hmm, the Faust compiler needs its time, as does the C++ compiler. I
don't think that you can achieve that right now.

-- 
Dr. Albert Gr"af
Dept. of Music-Informatics, University of Mainz, Germany
Email:  Dr.Graef at t-online.de, ag at muwiinfa.geschichte.uni-mainz.de
WWW:    http://www.musikinformatik.uni-mainz.de/ag



More information about the Linux-audio-dev mailing list