Name: Anonymous 2009-07-26 20:31
A
it can now be
or, if you're working with binary trees, instead of
it becomes
I'm working on a C-like compiler and I thought this would be a good idea.
->= operator, and possibly .=, which would make it easier to go through linked lists and other such structures with lots of pointers. Instead of writingp = p -> next;it can now be
p ->= next;or, if you're working with binary trees, instead of
while(t && t->v != i)
if(t->v < i)
t = t -> l;
else
t = t -> r;it becomes
while(t && t->v != i)
t ->= (t->v < i) ? l : r;I'm working on a C-like compiler and I thought this would be a good idea.