This paper [1] came around on LtU recently [2]. It has some interesting ideas for the grammar patterns that skaller talked about a while ago. It seems to have a lot of similar philosophies to our embedded syntax language. It looks like they even use an embedded scheme-like language as their production language.
[1]: http://www.cs.ucla.edu/~awarth/papers/dls07.pdf [2]: http://lambda-the-ultimate.org/node/2477 It looks like it has a couple nice features. First off, non-terminals can be named. So, you can do this exp ::= | <exp>:x '+' <fac>:y => '(+ ,x ,y) | <exp>:x '-' <fac>:y => '(- ,x ,y) | <fac> ; It could be handy since I always end up having to count the non-terminals in a grammar in order to do $5 or something. Second, it also allows for parameterized productions. This allows you to do something like: listOf p ::= <apply p> {',' <apply p>}*; where the p in <apply p> is a higher order function and the apply is just calling the p function. Finally, they have grammar classes. We might already be doing this, but I'm not positive. This lets you define a simple grammar, then replace bits and pieces of it in a subclass grammar. So, there might be some interesting insights in the paper that folks might want to check out. ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2005. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ Felix-language mailing list Felix-language@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/felix-language
