so that it also is called from the precedence parser. This is complicated by the fact that something needs to be done before the second operand is parsed in a single pass compiler, so it doesn't quite fit into expr_infix itself. It turns out the smallest code changes result when expr_landor remains separate. But it can be tidied a bit.
		
			
				
	
	
		
			41 lines
		
	
	
	
		
			775 B
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			41 lines
		
	
	
	
		
			775 B
		
	
	
	
		
			C
		
	
	
	
	
	
//#include <stdio.h>
 | 
						|
extern int printf(const char *, ...);
 | 
						|
 | 
						|
int main()
 | 
						|
{
 | 
						|
   int a;
 | 
						|
   int b;
 | 
						|
   int c;
 | 
						|
   int d;
 | 
						|
   int e;
 | 
						|
   int f;
 | 
						|
   int x;
 | 
						|
   int y;
 | 
						|
 | 
						|
   a = 12;
 | 
						|
   b = 34;
 | 
						|
   c = 56;
 | 
						|
   d = 78;
 | 
						|
   e = 0;
 | 
						|
   f = 1;
 | 
						|
 | 
						|
   printf("%d\n", c + d);
 | 
						|
   printf("%d\n", (y = c + d));
 | 
						|
   printf("%d\n", e || e && f);
 | 
						|
   printf("%d\n", e || f && f);
 | 
						|
   printf("%d\n", e && e || f);
 | 
						|
   printf("%d\n", e && f || f);
 | 
						|
   printf("%d\n", a && f | f);
 | 
						|
   printf("%d\n", a | b ^ c & d);
 | 
						|
   printf("%d, %d\n", a == a, a == b);
 | 
						|
   printf("%d, %d\n", a != a, a != b);
 | 
						|
   printf("%d\n", a != b && c != d);
 | 
						|
   printf("%d\n", a + b * c / f);
 | 
						|
   printf("%d\n", a + b * c / f);
 | 
						|
   printf("%d\n", (4 << 4));
 | 
						|
   printf("%d\n", (64 >> 4));
 | 
						|
 | 
						|
   return 0;
 | 
						|
}
 | 
						|
 | 
						|
// vim: set expandtab ts=4 sw=3 sts=3 tw=80 :
 |