I don't think I remember the exploding myself strategy from Karl Sims
videos:
http://www.youtube.com/watch?v=JBgG_VSP7f8
Do you remember where you saw that, Chris?
Cheers,
Robert Feldt
On Thu, Jan 9, 2014 at 4:29 PM, Chris Warburton
chriswa...@googlemail.comwrote:
Pavel Bažant pbaz
, 2014 at 3:38 PM, Robert Feldt robert.fe...@gmail.comwrote:
I don't think I remember the exploding myself strategy from Karl Sims
videos:
http://www.youtube.com/watch?v=JBgG_VSP7f8
Do you remember where you saw that, Chris?
Cheers,
Robert Feldt
On Thu, Jan 9, 2014 at 4:29 PM, Chris
just an artefact of basing it on
Long's version. Ruby does not require a certain order so can be reformatted
to be top-down.
Found at: https://github.com/robertfeldt/meta_compile
Cheers,
Robert Feldt
Diff to Long's support.h :
103c103
if (('A' = source[pos] source[pos
/10/2011 21:40, Casey Ransberger wrote:
Have you looked at Maru? It's likely(?) what you're after. Or was.
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
--
Best regards,
/Robert Feldt
--
Tech. Dr. (PhD), Assoc
-codecs.com/real_Alternative_download.htm
MPlayer (the video swiss army knife, for Linux/Windows/Mac):
http://www.mplayerhq.hu/
Good luck! :)
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
--
Best regards,
/Robert Feldt
of a thing/system it considers important
after disconsidering the parts which it consider irrelevant.
Best regards,
/Robert Feldt
--
Tech. Dr. (PhD), Assoc. Professor (Senior Lecturer) in Software Engineering
Chalmers, Software Engineering and Technology
Blekinge Institute of Technology, Software
Hi Michael,
Check out Rats source distribution (
http://www.cs.nyu.edu/rgrimm/xtc/xtc-core.zip )
in xtc/src/xtc/lang/C.rats which is a complete C grammar. It might use
Rats-specific constructs and the license is GPL2 so maybe not liberal
enough.
Regards,
Robert Feldt
On Thu, May 1, 2008 at 3
On Dec 11, 2007 11:45 PM, Alessandro Warth [EMAIL PROTECTED] wrote:
Hello Robert,
Hi Allessandro,
Earlier versions of OMeta used to pass production arguments on the program
stack. While this approach was efficient, it also made it really difficult
for the implementation to support
Have you looked at Katahdin? He made some interesting choices there to
support different types of recursion and precedence even while maintaining a
(mostly; he goes for longest-match or instead of prioritized choice) PEG
base. I haven't read your supporting recursion in peg paper yet but
