So is anyone looking at binary parser generators? It would seem like something like this would have been done ages ago. On Mar 25, 2013 12:07 PM, "Andre van Delft" <[email protected]> wrote:
> > Op 25 mrt. 2013, om 17:35 heeft John Tromp <[email protected]> het > volgende geschreven: > > >> PGA is very different from BLC of course, but both are a simple linear > >> notations. PGA starts with jump instructions, and it has step by step > >> extensions for variables, control structures, semaphores etc. It has > been > >> used as a projection of Ruby's OO constructs. > >> So I hope PGA could give you some ideas. > > > > PGA looks like a notation for control flow as a basis for an imperative > > language. BLC is a self-contained pure functional language aimed at > > minimal programs. This seems a case of comparing apples and oranges:-) > > Apples and oranges look far more similar than PGA and BLC. I would say it > is more a case of apples and apple trees. Very different in appearance, but > deep inside they share DNA, and the one form gives birth to the other form. > _______________________________________________ > fonc mailing list > [email protected] > http://vpri.org/mailman/listinfo/fonc >
_______________________________________________ fonc mailing list [email protected] http://vpri.org/mailman/listinfo/fonc
