#include <lib9.h>#include <bio.h>#include <ctype.h>#include "mach.h"#define Extern extern#include "acid.h"#include "y.tab.h" struct keywd{	char	*name;	int	terminal;}keywds[] ={	"do",		Tdo,	"if",		Tif,	"then",		Tthen,	"else",		Telse,	"while",	Twhile,	"loop",		Tloop,	"head",		Thead,	"tail",		Ttail,	"append",	Tappend,	"defn",		Tfn,	"return",	Tret,	"local",	Tlocal,	"aggr",		Tcomplex,	"union",	Tcomplex,	"adt",		Tcomplex,	"complex",	Tcomplex,	"delete",	Tdelete,	"whatis",	Twhat,	"eval",		Teval,	0,		0}; char cmap[256] ={	0,0,0,0,0,0,0,0,	/* 0-7 */	0,0,0,0,0,0,0,0,	/* 8-15 */	0,0,0,0,0,0,0,0,	/* 16-23 */	0,0,0,0,0,0,0,0,	/* 24-31 */	0,0,			/* 32-33 */	'"'+1,			/* 34	['"']	'"'+1,	*/	0,0,0,0,0,		/* 35-39 */	0,0,0,0,0,0,0,0,	/* 40-47 */	'\0'+1,			/* 48	['0']	'\0'+1, */	0,0,0,0,0,0,0,		/* 49-55 */	0,0,0,0,0,0,0,0,	/* 56-63 */	0,0,0,0,0,0,0,0,	/* 64-71 */	0,0,0,0,0,0,0,0,	/* 72-79 */	0,0,0,0,0,0,0,0,	/* 80-87 */	0,0,0,0,		/* 88-91 */	'\\'+1,			/* 92	['\\']	'\\'+1,	*/	0,0,0,0,		/* 93-96 */	'\a'+1,			/* 97	['a']	'\a'+1,	*/	'\b'+1,			/* 98	['b']	'\b'+1,	*/	0,0,0,			/* 99-101 */	'\f'+1,			/* 102	['f']	'\f'+1,	*/	0,0,0,0,0,0,0,		/* 103-109 */	'\n'+1,			/* 110	['n']	'\n'+1,	*/	0,0,0,			/* 111-113 */	'\r'+1,			/* 114	['r']	'\r'+1,	*/	0,			/* 115 */	'\t'+1,			/* 116	['t']	'\t'+1,	*/	0,			/* 117 */	'\v'+1,			/* 118	['v']	'\v'+1,	*/}; voidkinit(void){	int i;		for(i = 0; keywds[i].name; i++) 		enter(keywds[i].name, keywds[i].terminal);} typedef struct IOstack IOstack;struct IOstack{	char	*name;	int	line;	char	*text;	char	*ip;	Biobuf	*fin;	IOstack	*prev;};IOstack *lexio; voidpushfile(char *file){	Biobuf *b;	IOstack *io;	char buf[512];	extern char *acidlib; 	if(file){		b = Bopen(file, OREAD);		if(b == nil && strchr(file, '/') == 0){			snprint(buf, sizeof(buf)-1, "%s/%s", acidlib, file);			b = Bopen(buf, OREAD);		}	}	else{		b = gmalloc(sizeof(Biobuf));		if (Binit(b, 0, OREAD) == Beof) {			free(b);			b = 0;		}		file = "<stdin>";	} 	if(b == 0)		error("pushfile: %s: %r", file); 	io = gmalloc(sizeof(IOstack));	if(io == 0)		fatal("no memory");	io->name = strdup(file);	if(io->name == 0)		fatal("no memory");	io->line = line;	line = 1;	io->text = 0;	io->fin = b;	io->prev = lexio;	lexio = io;} voidpushstr(Node *s){	IOstack *io; 	io = gmalloc(sizeof(IOstack));	if(io == 0)		fatal("no memory");	io->line = line;	line = 1;	io->name = strdup("<string>");	if(io->name == 0)		fatal("no memory");	io->line = line;	line = 1;	io->text = strdup(s->nstore.u0.sstring->string);	if(io->text == 0)		fatal("no memory");	io->ip = io->text;	io->fin = 0;	io->prev = lexio;	lexio = io;} voidrestartio(void){	Bflush(lexio->fin);	Binit(lexio->fin, 0, OREAD);} intpopio(void){	IOstack *s; 	if(lexio == 0)		return 0; 	if(lexio->prev == 0){		if(lexio->fin)			restartio();		return 0;	} 	if(lexio->fin)		Bterm(lexio->fin);	else		free(lexio->text);	free(lexio->name);	line = lexio->line;	s = lexio;	lexio = s->prev;	free(s);	return 1;} intLfmt(Fmt *f){	int i;	char buf[1024];	IOstack *e; 	e = lexio;	if(e) {		i = sprint(buf, "%s:%d", e->name, line);		while(e->prev) {			e = e->prev;			if(initialising && e->prev == 0)				break;			i += sprint(buf+i, " [%s:%d]", e->name, e->line);		}	} else		sprint(buf, "no file:0");	return fmtstrcpy(f, buf);} voidunlexc(int s){	if(s == '\n')		line--; 	if(lexio->fin)		Bungetc(lexio->fin);	else		lexio->ip--;} intlexc(void){	int c; 	if(lexio->fin) {		c = Bgetc(lexio->fin);		if(gotint)			error("interrupt");		return c;	} 	c = *lexio->ip++;	if(c == 0)		return -1;	return c;} intescchar(char c){	int n;	char buf[Strsize]; 	if(c >= '0' && c <= '9') {		n = 1;		buf[0] = c;		for(;;) {			c = lexc();			if(c == Eof)				error("%d: <eof> in escape sequence", line);			if(strchr("0123456789xX", c) == 0) {				unlexc(c);				break;			}			buf[n++] = c;		}		buf[n] = '\0';		return strtol(buf, 0, 0);	} 	n = cmap[c];	if(n == 0)		return c;	return n-1;} voideatstring(void){	int esc, c, cnt;	char buf[Strsize]; 	esc = 0;	for(cnt = 0;;) {		c = lexc();		switch(c) {		case Eof:			error("%d: <eof> in string constant", line); 		case '\r':		case '\n':			error("newline in string constant");			goto done; 		case '\\':			if(esc)				goto Default;			esc = 1;			break; 		case '"':			if(esc == 0)				goto done; 			/* Fall through */		default:		Default:			if(esc) {				c = escchar(c);				esc = 0;			}			buf[cnt++] = c;			break;		}		if(cnt >= Strsize)			error("string token too long");	}done:	buf[cnt] = '\0';	yylval.string = strnode(buf);} voideatnl(void){	int c; 	line++;	for(;;) {		c = lexc();		if(c == Eof)			error("eof in comment");		if(c == '\n')			return;	}} intyylex(void){	int c;	extern char vfmt[]; loop:	Bflush(bout);	c = lexc();	switch(c) {	case Eof:		if(gotint) {			gotint = 0;			stacked = 0;			Bprint(bout, "\nacid: ");			goto loop;		}		return Eof; 	case '"':		eatstring();		return Tstring; 	case ' ':	case '\r':	case '\t':		goto loop; 	case '\n':		line++;		if(interactive == 0)			goto loop;		if(stacked) {			print("\t");			goto loop;		}		return ';'; 	case '.':		c = lexc();		unlexc(c);		if(isdigit(c))			return numsym('.'); 		return '.'; 	case '(':	case ')':	case '[':	case ']':	case ';':	case ':':	case ',':	case '~':	case '?':	case '*':	case '@':	case '^':	case '%':		return c;	case '{':		stacked++;		return c;	case '}':		stacked--;		return c; 	case '\\':		c = lexc();		if(strchr(vfmt, c) == 0) {			unlexc(c);			return '\\';		}		yylval.ival = c;		return Tfmt; 	case '!':		c = lexc();		if(c == '=')			return Tneq;		unlexc(c);		return '!'; 	case '+':		c = lexc();		if(c == '+')			return Tinc;		unlexc(c);		return '+'; 	case '/':		c = lexc();		if(c == '/') {			eatnl();			goto loop;		}		unlexc(c);		return '/'; 	case '\'':		c = lexc();		if(c == '\\')			yylval.ival = escchar(lexc());		else			yylval.ival = c;		c = lexc();		if(c != '\'') {			error("missing '");			unlexc(c);		}		return Tconst; 	case '&':		c = lexc();		if(c == '&')			return Tandand;		unlexc(c);		return '&'; 	case '=':		c = lexc();		if(c == '=')			return Teq;		unlexc(c);		return '='; 	case '|':		c = lexc();		if(c == '|')			return Toror;		unlexc(c);		return '|'; 	case '<':		c = lexc();		if(c == '=')			return Tleq;		if(c == '<')			return Tlsh;		unlexc(c);		return '<'; 	case '>':		c = lexc();		if(c == '=')			return Tgeq;		if(c == '>')			return Trsh;		unlexc(c);		return '>'; 	case '-':		c = lexc(); 		if(c == '>')			return Tindir; 		if(c == '-')			return Tdec;		unlexc(c);		return '-'; 	default:		return numsym(c);	}} intnumsym(char first){

Lines 1–500 of 636. Load more