Hi all!
I was glancing over these books [1] and [2] on tree automata. I assume that Racket's macro system / syntax transformations fall under the category of tree transducers. Can anybody please point me to a paper which describes its expressive power in formal terms, if any? The reason I ask is that one of the google-summer-of-code projects for apertium.org I'm involved with is to implement a recursive transfer system for translating natural languages. I'm curious how the proposed system compares to racket's of the shelf pattern matching's or macros' expressiveness. Such a paper will probably be above my head at this time, but if I knew that both the transfer system being developed at apertium and Racket's pattern matcher are actually, say, something called "synchronous context free grammars", it would be clear that there's not much point to develop something exactly like that from scratch at apertium. Best, Ilnar -- GPG: 0xF3ED6A19 [1] https://arxiv.org/abs/1509.06233 [2] https://gforge.inria.fr/frs/?group_id=426&release_id=3091#tata-_2008-11-title-content -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
