#define p struct c
#define q struct b
#define h a->a
#define i a->b
#define e i->c
#define o a=(*b->a)(b->b,b->c)
#define s return a;}q*
#define n (d,b)p*b;{q*a;p*c;
#define z(t)(t*)malloc(sizeof(t))
q{int a;p{q*(*a)();int b;p*c;}*b;};q*u n a=z(q);h=d;i=z(p);i->a=u;i->b=d+1;s
v n c=b;do o,b=i;while(!(h%d));i=c;i->a=v;i->b=d;e=b;s
w n o;c=i;i=b;i->a=w;e=z(p);e->a=v;e->b=h;e->c=c;s
t n for(;;)o,main(-h),b=i;}main(b){p*a;if(b>0)a=z(p),h=w,a->c=z(p),a->c->a=u,
a->c->b=2,t(0,a);putchar(b?main(b/2),-b%2+'0':10);} 

struct mr
{
	unsigned i;//номер по порядку, хотя я не уверен в его необходимости
	char* identifier = NULL;
	char* replacement_list = NULL;
};
...

struct mr* mrl = NULL;

#include <stdio.h>
#include <stdlib.h>

struct b
{ 
	int a; 
	struct c
	{ 
		struct b*(*a)(); 
		int b; 
		struct c*c; 
	}*b; 
}; 

struct b* u(int d, struct c* b)
{
	struct b* a; 
	struct c* c; 
	a = (struct b*)malloc(sizeof(struct b)); 
	a->a = d; 
	a->b = (struct c*)malloc(sizeof(struct c)); 
	a->b->a = u; 
	a->b->b = d + 1;
	return a; 
}

struct b* v(int d, struct c* b)
{
	struct b* a; 
	struct c*c; 
	c = b; 
	do a = (*b->a)(b->b, b->c), b = a->b; 
	while (!(a->a%d)); 
	
	a->b = c; 
	a->b->a = v; 
	a->b->b = d; 
	a->b->c = b; 
	return a; 
} 

struct b* w(int d, struct c* b)
{
	struct b* a; 
	struct c* c; 
	a = (*b->a)(b->b, b->c); 
	c = a->b; 
	a->b = b; 
	a->b->a = w; 
	a->b->c = (struct c*)malloc(sizeof(struct c)); 
	a->b->c->a = v; 
	a->b->c->b = a->a; 
	a->b->c->c = c; 
	return a; 
}

struct b* t(int d, struct c* b) 
{ 
	struct b*a; 
	struct c*c; 
	for (;;)
		a = (*b->a)(b->b, b->c), main(-a->a), b = a->b; 
}

main(int b)
{
	struct c*a; 
	if (b>0)a = (struct c*)malloc(sizeof(struct c)), a->a = w, a->c = (struct c*)malloc(sizeof(struct c)), a->c->a = u,
		a->c->b = 2, t(0, a); 
	putchar(b ? main(b / 2), -b % 2 + '0' : 10);
}