No, he showed how one could use a macro system to obtain a C-like structure-indexing system in Scheme.
Read the whole thing, don't just read the first paragraph like one of today's kids. (-: Shriram On Wed, Aug 18, 2010 at 10:34 AM, Mathew Kurian <bluejamesb...@gmail.com> wrote: > > > On Wed, Aug 18, 2010 at 2:41 AM, Eduardo Cavazos <wayo.cava...@gmail.com> > wrote: >> >> Mathew Kurian: >> >>> However, in the case of universe/world teachpacks, where the use of >>> states is a vital component, a set of code can get very long, >>> especially if the program is very complex and contains multiple >>> structures (in some cases structures inside structures inside >>> structures) within the states. >> >> I agree with the critique of lengthy expressions involving nested records >> (structs). >> >> Here's how I deal with it: >> >> http://gist.github.com/364754 >> >> The particular solution is for R6RS but PLT has the necessary mechanisms >> for it. >> >> Ed > > Hey Ed, > If you have spare time, can you please explain by what you meant in that > github website. All I saw was a comparison between C and Scheme. > Thank you > Mathew K. > > > _________________________________________________ > For list-related administrative tasks: > http://lists.racket-lang.org/listinfo/users > _________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
