enum { BC, DE, HL };
#include "c.h"
#define NODEPTR_TYPE Node
#define OP_LABEL(p) ((p)->op)
#define LEFT_CHILD(p) ((p)->kids[0])
#define RIGHT_CHILD(p) ((p)->kids[1])
#define LEFT_X_CHILD(p) ((p)->x.kids[0])
#define RIGHT_X_CHILD(p) ((p)->x.kids[1])
#define STATE_LABEL(p) ((p)->x.state)
static void address		ARGS((Symbol, Symbol, int));
static void blkfetch	ARGS((int, int, int, int));
static void blkloop		ARGS((int, int, int, int, int, int[]));
static void blkstore	ARGS((int, int, int, int));
static void defaddress	ARGS((Symbol));
static void defconst	ARGS((int, Value));
static void defstring	ARGS((int, char *));
static void defsymbol	ARGS((Symbol));
static void doarg		ARGS((Node));
static void emit2		ARGS((Node));
static void export		ARGS((Symbol));
static void clobber		ARGS((Node));
static void function	ARGS((Symbol, Symbol [], Symbol [], int));
static void global		ARGS((Symbol));
static void import		ARGS((Symbol));
static void local		ARGS((Symbol));
static void space		ARGS((int));
static void offsetsp	ARGS((int));
static void offsethl	ARGS((int));
static void progend		ARGS((void));
static void segment		ARGS((int));
static void space		ARGS((int));
static void target		ARGS((Node));
static int ckstack		ARGS((Node, int));
static Symbol charreg[32], intreg[32];
static Symbol fltreg[32];
static char *hreg[] = { "B", "D", "H" };
static char *lreg[] = { "C", "E", "L" };

static int cseg;
static int argstack;

/*
generated at Mon May  6 15:34:41 1996
by $Id: lburg.c,v 2.2.1.2 1995/12/20 19:09:53 drh Exp $
*/
static void _kids ARGS((NODEPTR_TYPE, int, NODEPTR_TYPE[]));
static void _label ARGS((NODEPTR_TYPE));
static int _rule ARGS((void*, int));

#define _stmt_NT 1
#define _reg_NT 2
#define _con_NT 3
#define _acon_NT 4
#define _stk_NT 5
#define _base_NT 6
#define _addr_NT 7
#define _rc_NT 8
#define _rc8_NT 9
#define _rc5_NT 10
#define _flt_NT 11
#define _addrj_NT 12

static char *_ntname[] = {
	0,
	"stmt",
	"reg",
	"con",
	"acon",
	"stk",
	"base",
	"addr",
	"rc",
	"rc8",
	"rc5",
	"flt",
	"addrj",
	0
};

struct _state {
	short cost[13];
	struct {
		unsigned int _stmt:6;
		unsigned int _reg:7;
		unsigned int _con:3;
		unsigned int _acon:2;
		unsigned int _stk:2;
		unsigned int _base:2;
		unsigned int _addr:1;
		unsigned int _rc:2;
		unsigned int _rc8:2;
		unsigned int _rc5:2;
		unsigned int _flt:1;
		unsigned int _addrj:2;
	} rule;
};

static short _nts_0[] = { 0 };
static short _nts_1[] = { _reg_NT, 0 };
static short _nts_2[] = { _con_NT, 0 };
static short _nts_3[] = { _stk_NT, 0 };
static short _nts_4[] = { _acon_NT, 0 };
static short _nts_5[] = { _base_NT, 0 };
static short _nts_6[] = { _addr_NT, 0 };
static short _nts_7[] = { _rc_NT, 0 };
static short _nts_8[] = { _reg_NT, _rc_NT, 0 };
static short _nts_9[] = { _reg_NT, _rc8_NT, 0 };
static short _nts_10[] = { _reg_NT, _reg_NT, 0 };
static short _nts_11[] = { _addr_NT, _rc_NT, 0 };
static short _nts_12[] = { _stk_NT, _rc5_NT, 0 };
static short _nts_13[] = { _addr_NT, _reg_NT, 0 };
static short _nts_14[] = { _reg_NT, _flt_NT, 0 };
static short _nts_15[] = { _addrj_NT, 0 };

static short *_nts[] = {
	0,	/* 0 */
	_nts_0,	/* 1 */
	_nts_0,	/* 2 */
	_nts_0,	/* 3 */
	_nts_0,	/* 4 */
	_nts_0,	/* 5 */
	_nts_0,	/* 6 */
	_nts_1,	/* 7 */
	_nts_1,	/* 8 */
	_nts_1,	/* 9 */
	_nts_1,	/* 10 */
	_nts_1,	/* 11 */
	_nts_1,	/* 12 */
	_nts_0,	/* 13 */
	_nts_0,	/* 14 */
	_nts_0,	/* 15 */
	_nts_0,	/* 16 */
	_nts_0,	/* 17 */
	_nts_1,	/* 18 */
	_nts_1,	/* 19 */
	_nts_1,	/* 20 */
	_nts_1,	/* 21 */
	_nts_1,	/* 22 */
	_nts_0,	/* 23 */
	_nts_2,	/* 24 */
	_nts_0,	/* 25 */
	_nts_0,	/* 26 */
	_nts_3,	/* 27 */
	_nts_1,	/* 28 */
	_nts_4,	/* 29 */
	_nts_5,	/* 30 */
	_nts_1,	/* 31 */
	_nts_2,	/* 32 */
	_nts_6,	/* 33 */
	_nts_6,	/* 34 */
	_nts_6,	/* 35 */
	_nts_6,	/* 36 */
	_nts_3,	/* 37 */
	_nts_3,	/* 38 */
	_nts_3,	/* 39 */
	_nts_3,	/* 40 */
	_nts_6,	/* 41 */
	_nts_7,	/* 42 */
	_nts_1,	/* 43 */
	_nts_1,	/* 44 */
	_nts_1,	/* 45 */
	_nts_1,	/* 46 */
	_nts_1,	/* 47 */
	_nts_8,	/* 48 */
	_nts_8,	/* 49 */
	_nts_8,	/* 50 */
	_nts_8,	/* 51 */
	_nts_8,	/* 52 */
	_nts_8,	/* 53 */
	_nts_8,	/* 54 */
	_nts_8,	/* 55 */
	_nts_8,	/* 56 */
	_nts_1,	/* 57 */
	_nts_1,	/* 58 */
	_nts_0,	/* 59 */
	_nts_1,	/* 60 */
	_nts_9,	/* 61 */
	_nts_9,	/* 62 */
	_nts_9,	/* 63 */
	_nts_9,	/* 64 */
	_nts_10,	/* 65 */
	_nts_10,	/* 66 */
	_nts_10,	/* 67 */
	_nts_10,	/* 68 */
	_nts_10,	/* 69 */
	_nts_10,	/* 70 */
	_nts_1,	/* 71 */
	_nts_1,	/* 72 */
	_nts_1,	/* 73 */
	_nts_1,	/* 74 */
	_nts_1,	/* 75 */
	_nts_1,	/* 76 */
	_nts_1,	/* 77 */
	_nts_1,	/* 78 */
	_nts_1,	/* 79 */
	_nts_1,	/* 80 */
	_nts_1,	/* 81 */
	_nts_1,	/* 82 */
	_nts_2,	/* 83 */
	_nts_1,	/* 84 */
	_nts_11,	/* 85 */
	_nts_11,	/* 86 */
	_nts_11,	/* 87 */
	_nts_11,	/* 88 */
	_nts_12,	/* 89 */
	_nts_12,	/* 90 */
	_nts_12,	/* 91 */
	_nts_12,	/* 92 */
	_nts_1,	/* 93 */
	_nts_1,	/* 94 */
	_nts_10,	/* 95 */
	_nts_1,	/* 96 */
	_nts_6,	/* 97 */
	_nts_6,	/* 98 */
	_nts_13,	/* 99 */
	_nts_13,	/* 100 */
	_nts_1,	/* 101 */
	_nts_1,	/* 102 */
	_nts_1,	/* 103 */
	_nts_1,	/* 104 */
	_nts_14,	/* 105 */
	_nts_14,	/* 106 */
	_nts_14,	/* 107 */
	_nts_14,	/* 108 */
	_nts_14,	/* 109 */
	_nts_14,	/* 110 */
	_nts_14,	/* 111 */
	_nts_14,	/* 112 */
	_nts_1,	/* 113 */
	_nts_1,	/* 114 */
	_nts_1,	/* 115 */
	_nts_1,	/* 116 */
	_nts_0,	/* 117 */
	_nts_1,	/* 118 */
	_nts_15,	/* 119 */
	_nts_0,	/* 120 */
	_nts_8,	/* 121 */
	_nts_8,	/* 122 */
	_nts_8,	/* 123 */
	_nts_8,	/* 124 */
	_nts_8,	/* 125 */
	_nts_8,	/* 126 */
	_nts_8,	/* 127 */
	_nts_8,	/* 128 */
	_nts_8,	/* 129 */
	_nts_8,	/* 130 */
	_nts_10,	/* 131 */
	_nts_10,	/* 132 */
	_nts_10,	/* 133 */
	_nts_10,	/* 134 */
	_nts_10,	/* 135 */
	_nts_10,	/* 136 */
	_nts_10,	/* 137 */
	_nts_10,	/* 138 */
	_nts_10,	/* 139 */
	_nts_10,	/* 140 */
	_nts_10,	/* 141 */
	_nts_10,	/* 142 */
	_nts_15,	/* 143 */
	_nts_15,	/* 144 */
	_nts_15,	/* 145 */
	_nts_15,	/* 146 */
	_nts_1,	/* 147 */
	_nts_1,	/* 148 */
	_nts_1,	/* 149 */
};

static char _arity[] = {
	0,	/* 0 */
	0,	/* 1 */
	0,	/* 2 */
	0,	/* 3 */
	0,	/* 4 */
	0,	/* 5 */
	0,	/* 6 */
	0,	/* 7 */
	0,	/* 8 */
	0,	/* 9 */
	0,	/* 10 */
	0,	/* 11 */
	0,	/* 12 */
	0,	/* 13 */
	0,	/* 14 */
	0,	/* 15 */
	0,	/* 16 */
	0,	/* 17=CNSTF */
	0,	/* 18=CNSTD */
	0,	/* 19=CNSTC */
	0,	/* 20=CNSTS */
	0,	/* 21=CNSTI */
	0,	/* 22=CNSTU */
	0,	/* 23=CNSTP */
	0,	/* 24 */
	0,	/* 25 */
	0,	/* 26 */
	0,	/* 27 */
	0,	/* 28 */
	0,	/* 29 */
	0,	/* 30 */
	0,	/* 31 */
	0,	/* 32 */
	1,	/* 33=ARGF */
	1,	/* 34=ARGD */
	0,	/* 35 */
	0,	/* 36 */
	1,	/* 37=ARGI */
	0,	/* 38 */
	1,	/* 39=ARGP */
	0,	/* 40 */
	1,	/* 41=ARGB */
	0,	/* 42 */
	0,	/* 43 */
	0,	/* 44 */
	0,	/* 45 */
	0,	/* 46 */
	0,	/* 47 */
	0,	/* 48 */
	2,	/* 49=ASGNF */
	2,	/* 50=ASGND */
	2,	/* 51=ASGNC */
	2,	/* 52=ASGNS */
	2,	/* 53=ASGNI */
	0,	/* 54 */
	2,	/* 55=ASGNP */
	0,	/* 56 */
	2,	/* 57=ASGNB */
	0,	/* 58 */
	0,	/* 59 */
	0,	/* 60 */
	0,	/* 61 */
	0,	/* 62 */
	0,	/* 63 */
	0,	/* 64 */
	1,	/* 65=INDIRF */
	1,	/* 66=INDIRD */
	1,	/* 67=INDIRC */
	1,	/* 68=INDIRS */
	1,	/* 69=INDIRI */
	0,	/* 70 */
	1,	/* 71=INDIRP */
	0,	/* 72 */
	1,	/* 73=INDIRB */
	0,	/* 74 */
	0,	/* 75 */
	0,	/* 76 */
	0,	/* 77 */
	0,	/* 78 */
	0,	/* 79 */
	0,	/* 80 */
	0,	/* 81 */
	0,	/* 82 */
	0,	/* 83 */
	0,	/* 84 */
	1,	/* 85=CVCI */
	1,	/* 86=CVCU */
	0,	/* 87 */
	0,	/* 88 */
	0,	/* 89 */
	0,	/* 90 */
	0,	/* 91 */
	0,	/* 92 */
	0,	/* 93 */
	0,	/* 94 */
	0,	/* 95 */
	0,	/* 96 */
	1,	/* 97=CVDF */
	0,	/* 98 */
	0,	/* 99 */
	0,	/* 100 */
	1,	/* 101=CVDI */
	0,	/* 102 */
	0,	/* 103 */
	0,	/* 104 */
	0,	/* 105 */
	0,	/* 106 */
	0,	/* 107 */
	0,	/* 108 */
	0,	/* 109 */
	0,	/* 110 */
	0,	/* 111 */
	0,	/* 112 */
	0,	/* 113 */
	1,	/* 114=CVFD */
	0,	/* 115 */
	0,	/* 116 */
	0,	/* 117 */
	0,	/* 118 */
	0,	/* 119 */
	0,	/* 120 */
	0,	/* 121 */
	0,	/* 122 */
	0,	/* 123 */
	0,	/* 124 */
	0,	/* 125 */
	0,	/* 126 */
	0,	/* 127 */
	0,	/* 128 */
	0,	/* 129 */
	1,	/* 130=CVID */
	1,	/* 131=CVIC */
	1,	/* 132=CVIS */
	0,	/* 133 */
	1,	/* 134=CVIU */
	0,	/* 135 */
	0,	/* 136 */
	0,	/* 137 */
	0,	/* 138 */
	0,	/* 139 */
	0,	/* 140 */
	0,	/* 141 */
	0,	/* 142 */
	0,	/* 143 */
	0,	/* 144 */
	0,	/* 145 */
	0,	/* 146 */
	0,	/* 147 */
	0,	/* 148 */
	0,	/* 149 */
	1,	/* 150=CVPU */
	0,	/* 151 */
	0,	/* 152 */
	0,	/* 153 */
	0,	/* 154 */
	0,	/* 155 */
	0,	/* 156 */
	0,	/* 157 */
	0,	/* 158 */
	0,	/* 159 */
	0,	/* 160 */
	0,	/* 161 */
	0,	/* 162 */
	0,	/* 163 */
	0,	/* 164 */
	1,	/* 165=CVSI */
	1,	/* 166=CVSU */
	0,	/* 167 */
	0,	/* 168 */
	0,	/* 169 */
	0,	/* 170 */
	0,	/* 171 */
	0,	/* 172 */
	0,	/* 173 */
	0,	/* 174 */
	0,	/* 175 */
	0,	/* 176 */
	0,	/* 177 */
	0,	/* 178 */
	1,	/* 179=CVUC */
	1,	/* 180=CVUS */
	1,	/* 181=CVUI */
	0,	/* 182 */
	1,	/* 183=CVUP */
	0,	/* 184 */
	0,	/* 185 */
	0,	/* 186 */
	0,	/* 187 */
	0,	/* 188 */
	0,	/* 189 */
	0,	/* 190 */
	0,	/* 191 */
	0,	/* 192 */
	1,	/* 193=NEGF */
	1,	/* 194=NEGD */
	0,	/* 195 */
	0,	/* 196 */
	1,	/* 197=NEGI */
	0,	/* 198 */
	0,	/* 199 */
	0,	/* 200 */
	0,	/* 201 */
	0,	/* 202 */
	0,	/* 203 */
	0,	/* 204 */
	0,	/* 205 */
	0,	/* 206 */
	0,	/* 207 */
	0,	/* 208 */
	1,	/* 209=CALLF */
	1,	/* 210=CALLD */
	0,	/* 211 */
	0,	/* 212 */
	1,	/* 213=CALLI */
	0,	/* 214 */
	0,	/* 215 */
	1,	/* 216=CALLV */
	0,	/* 217=CALLB */
	0,	/* 218 */
	0,	/* 219 */
	0,	/* 220 */
	0,	/* 221 */
	0,	/* 222 */
	0,	/* 223 */
	0,	/* 224 */
	0,	/* 225=LOADF */
	0,	/* 226=LOADD */
	1,	/* 227=LOADC */
	1,	/* 228=LOADS */
	1,	/* 229=LOADI */
	1,	/* 230=LOADU */
	1,	/* 231=LOADP */
	0,	/* 232 */
	0,	/* 233=LOADB */
	0,	/* 234 */
	0,	/* 235 */
	0,	/* 236 */
	0,	/* 237 */
	0,	/* 238 */
	0,	/* 239 */
	0,	/* 240 */
	1,	/* 241=RETF */
	1,	/* 242=RETD */
	0,	/* 243 */
	0,	/* 244 */
	1,	/* 245=RETI */
	0,	/* 246 */
	0,	/* 247 */
	0,	/* 248 */
	0,	/* 249 */
	0,	/* 250 */
	0,	/* 251 */
	0,	/* 252 */
	0,	/* 253 */
	0,	/* 254 */
	0,	/* 255 */
	0,	/* 256 */
	0,	/* 257 */
	0,	/* 258 */
	0,	/* 259 */
	0,	/* 260 */
	0,	/* 261 */
	0,	/* 262 */
	0,	/* 263=ADDRGP */
	0,	/* 264 */
	0,	/* 265 */
	0,	/* 266 */
	0,	/* 267 */
	0,	/* 268 */
	0,	/* 269 */
	0,	/* 270 */
	0,	/* 271 */
	0,	/* 272 */
	0,	/* 273 */
	0,	/* 274 */
	0,	/* 275 */
	0,	/* 276 */
	0,	/* 277 */
	0,	/* 278 */
	0,	/* 279=ADDRFP */
	0,	/* 280 */
	0,	/* 281 */
	0,	/* 282 */
	0,	/* 283 */
	0,	/* 284 */
	0,	/* 285 */
	0,	/* 286 */
	0,	/* 287 */
	0,	/* 288 */
	0,	/* 289 */
	0,	/* 290 */
	0,	/* 291 */
	0,	/* 292 */
	0,	/* 293 */
	0,	/* 294 */
	0,	/* 295=ADDRLP */
	0,	/* 296 */
	0,	/* 297 */
	0,	/* 298 */
	0,	/* 299 */
	0,	/* 300 */
	0,	/* 301 */
	0,	/* 302 */
	0,	/* 303 */
	0,	/* 304 */
	2,	/* 305=ADDF */
	2,	/* 306=ADDD */
	0,	/* 307 */
	0,	/* 308 */
	2,	/* 309=ADDI */
	2,	/* 310=ADDU */
	2,	/* 311=ADDP */
	0,	/* 312 */
	0,	/* 313 */
	0,	/* 314 */
	0,	/* 315 */
	0,	/* 316 */
	0,	/* 317 */
	0,	/* 318 */
	0,	/* 319 */
	0,	/* 320 */
	2,	/* 321=SUBF */
	2,	/* 322=SUBD */
	0,	/* 323 */
	0,	/* 324 */
	2,	/* 325=SUBI */
	2,	/* 326=SUBU */
	2,	/* 327=SUBP */
	0,	/* 328 */
	0,	/* 329 */
	0,	/* 330 */
	0,	/* 331 */
	0,	/* 332 */
	0,	/* 333 */
	0,	/* 334 */
	0,	/* 335 */
	0,	/* 336 */
	0,	/* 337 */
	0,	/* 338 */
	0,	/* 339 */
	0,	/* 340 */
	2,	/* 341=LSHI */
	2,	/* 342=LSHU */
	0,	/* 343 */
	0,	/* 344 */
	0,	/* 345 */
	0,	/* 346 */
	0,	/* 347 */
	0,	/* 348 */
	0,	/* 349 */
	0,	/* 350 */
	0,	/* 351 */
	0,	/* 352 */
	0,	/* 353 */
	0,	/* 354 */
	0,	/* 355 */
	0,	/* 356 */
	2,	/* 357=MODI */
	2,	/* 358=MODU */
	0,	/* 359 */
	0,	/* 360 */
	0,	/* 361 */
	0,	/* 362 */
	0,	/* 363 */
	0,	/* 364 */
	0,	/* 365 */
	0,	/* 366 */
	0,	/* 367 */
	0,	/* 368 */
	0,	/* 369 */
	0,	/* 370 */
	0,	/* 371 */
	0,	/* 372 */
	2,	/* 373=RSHI */
	2,	/* 374=RSHU */
	0,	/* 375 */
	0,	/* 376 */
	0,	/* 377 */
	0,	/* 378 */
	0,	/* 379 */
	0,	/* 380 */
	0,	/* 381 */
	0,	/* 382 */
	0,	/* 383 */
	0,	/* 384 */
	0,	/* 385 */
	0,	/* 386 */
	0,	/* 387 */
	0,	/* 388 */
	0,	/* 389 */
	2,	/* 390=BANDU */
	0,	/* 391 */
	0,	/* 392 */
	0,	/* 393 */
	0,	/* 394 */
	0,	/* 395 */
	0,	/* 396 */
	0,	/* 397 */
	0,	/* 398 */
	0,	/* 399 */
	0,	/* 400 */
	0,	/* 401 */
	0,	/* 402 */
	0,	/* 403 */
	0,	/* 404 */
	0,	/* 405 */
	1,	/* 406=BCOMU */
	0,	/* 407 */
	0,	/* 408 */
	0,	/* 409 */
	0,	/* 410 */
	0,	/* 411 */
	0,	/* 412 */
	0,	/* 413 */
	0,	/* 414 */
	0,	/* 415 */
	0,	/* 416 */
	0,	/* 417 */
	0,	/* 418 */
	0,	/* 419 */
	0,	/* 420 */
	0,	/* 421 */
	2,	/* 422=BORU */
	0,	/* 423 */
	0,	/* 424 */
	0,	/* 425 */
	0,	/* 426 */
	0,	/* 427 */
	0,	/* 428 */
	0,	/* 429 */
	0,	/* 430 */
	0,	/* 431 */
	0,	/* 432 */
	0,	/* 433 */
	0,	/* 434 */
	0,	/* 435 */
	0,	/* 436 */
	0,	/* 437 */
	2,	/* 438=BXORU */
	0,	/* 439 */
	0,	/* 440 */
	0,	/* 441 */
	0,	/* 442 */
	0,	/* 443 */
	0,	/* 444 */
	0,	/* 445 */
	0,	/* 446 */
	0,	/* 447 */
	0,	/* 448 */
	2,	/* 449=DIVF */
	2,	/* 450=DIVD */
	0,	/* 451 */
	0,	/* 452 */
	2,	/* 453=DIVI */
	2,	/* 454=DIVU */
	0,	/* 455 */
	0,	/* 456 */
	0,	/* 457 */
	0,	/* 458 */
	0,	/* 459 */
	0,	/* 460 */
	0,	/* 461 */
	0,	/* 462 */
	0,	/* 463 */
	0,	/* 464 */
	2,	/* 465=MULF */
	2,	/* 466=MULD */
	0,	/* 467 */
	0,	/* 468 */
	2,	/* 469=MULI */
	2,	/* 470=MULU */
	0,	/* 471 */
	0,	/* 472 */
	0,	/* 473 */
	0,	/* 474 */
	0,	/* 475 */
	0,	/* 476 */
	0,	/* 477 */
	0,	/* 478 */
	0,	/* 479 */
	0,	/* 480 */
	2,	/* 481=EQF */
	2,	/* 482=EQD */
	0,	/* 483 */
	0,	/* 484 */
	2,	/* 485=EQI */
	0,	/* 486 */
	0,	/* 487 */
	0,	/* 488 */
	0,	/* 489 */
	0,	/* 490 */
	0,	/* 491 */
	0,	/* 492 */
	0,	/* 493 */
	0,	/* 494 */
	0,	/* 495 */
	0,	/* 496 */
	2,	/* 497=GEF */
	2,	/* 498=GED */
	0,	/* 499 */
	0,	/* 500 */
	2,	/* 501=GEI */
	2,	/* 502=GEU */
	0,	/* 503 */
	0,	/* 504 */
	0,	/* 505 */
	0,	/* 506 */
	0,	/* 507 */
	0,	/* 508 */
	0,	/* 509 */
	0,	/* 510 */
	0,	/* 511 */
	0,	/* 512 */
	2,	/* 513=GTF */
	2,	/* 514=GTD */
	0,	/* 515 */
	0,	/* 516 */
	2,	/* 517=GTI */
	2,	/* 518=GTU */
	0,	/* 519 */
	0,	/* 520 */
	0,	/* 521 */
	0,	/* 522 */
	0,	/* 523 */
	0,	/* 524 */
	0,	/* 525 */
	0,	/* 526 */
	0,	/* 527 */
	0,	/* 528 */
	2,	/* 529=LEF */
	2,	/* 530=LED */
	0,	/* 531 */
	0,	/* 532 */
	2,	/* 533=LEI */
	2,	/* 534=LEU */
	0,	/* 535 */
	0,	/* 536 */
	0,	/* 537 */
	0,	/* 538 */
	0,	/* 539 */
	0,	/* 540 */
	0,	/* 541 */
	0,	/* 542 */
	0,	/* 543 */
	0,	/* 544 */
	2,	/* 545=LTF */
	2,	/* 546=LTD */
	0,	/* 547 */
	0,	/* 548 */
	2,	/* 549=LTI */
	2,	/* 550=LTU */
	0,	/* 551 */
	0,	/* 552 */
	0,	/* 553 */
	0,	/* 554 */
	0,	/* 555 */
	0,	/* 556 */
	0,	/* 557 */
	0,	/* 558 */
	0,	/* 559 */
	0,	/* 560 */
	2,	/* 561=NEF */
	2,	/* 562=NED */
	0,	/* 563 */
	0,	/* 564 */
	2,	/* 565=NEI */
	0,	/* 566 */
	0,	/* 567 */
	0,	/* 568 */
	0,	/* 569 */
	0,	/* 570 */
	0,	/* 571 */
	0,	/* 572 */
	0,	/* 573 */
	0,	/* 574 */
	0,	/* 575 */
	0,	/* 576 */
	0,	/* 577 */
	0,	/* 578 */
	0,	/* 579 */
	0,	/* 580 */
	0,	/* 581 */
	0,	/* 582 */
	0,	/* 583 */
	1,	/* 584=JUMPV */
	0,	/* 585 */
	0,	/* 586 */
	0,	/* 587 */
	0,	/* 588 */
	0,	/* 589 */
	0,	/* 590 */
	0,	/* 591 */
	0,	/* 592 */
	0,	/* 593 */
	0,	/* 594 */
	0,	/* 595 */
	0,	/* 596 */
	0,	/* 597 */
	0,	/* 598 */
	0,	/* 599 */
	0,	/* 600=LABELV */
	0,	/* 601 */
	0,	/* 602 */
	0,	/* 603 */
	0,	/* 604 */
	0,	/* 605 */
	0,	/* 606 */
	0,	/* 607 */
	0,	/* 608 */
	0,	/* 609 */
	0,	/* 610 */
	0,	/* 611 */
	0,	/* 612 */
	0,	/* 613 */
	0,	/* 614 */
	0,	/* 615=VREGP */
};

static char *_opname[] = {
/* 0 */	0,
/* 1 */	0,
/* 2 */	0,
/* 3 */	0,
/* 4 */	0,
/* 5 */	0,
/* 6 */	0,
/* 7 */	0,
/* 8 */	0,
/* 9 */	0,
/* 10 */	0,
/* 11 */	0,
/* 12 */	0,
/* 13 */	0,
/* 14 */	0,
/* 15 */	0,
/* 16 */	0,
/* 17 */	"CNSTF",
/* 18 */	"CNSTD",
/* 19 */	"CNSTC",
/* 20 */	"CNSTS",
/* 21 */	"CNSTI",
/* 22 */	"CNSTU",
/* 23 */	"CNSTP",
/* 24 */	0,
/* 25 */	0,
/* 26 */	0,
/* 27 */	0,
/* 28 */	0,
/* 29 */	0,
/* 30 */	0,
/* 31 */	0,
/* 32 */	0,
/* 33 */	"ARGF",
/* 34 */	"ARGD",
/* 35 */	0,
/* 36 */	0,
/* 37 */	"ARGI",
/* 38 */	0,
/* 39 */	"ARGP",
/* 40 */	0,
/* 41 */	"ARGB",
/* 42 */	0,
/* 43 */	0,
/* 44 */	0,
/* 45 */	0,
/* 46 */	0,
/* 47 */	0,
/* 48 */	0,
/* 49 */	"ASGNF",
/* 50 */	"ASGND",
/* 51 */	"ASGNC",
/* 52 */	"ASGNS",
/* 53 */	"ASGNI",
/* 54 */	0,
/* 55 */	"ASGNP",
/* 56 */	0,
/* 57 */	"ASGNB",
/* 58 */	0,
/* 59 */	0,
/* 60 */	0,
/* 61 */	0,
/* 62 */	0,
/* 63 */	0,
/* 64 */	0,
/* 65 */	"INDIRF",
/* 66 */	"INDIRD",
/* 67 */	"INDIRC",
/* 68 */	"INDIRS",
/* 69 */	"INDIRI",
/* 70 */	0,
/* 71 */	"INDIRP",
/* 72 */	0,
/* 73 */	"INDIRB",
/* 74 */	0,
/* 75 */	0,
/* 76 */	0,
/* 77 */	0,
/* 78 */	0,
/* 79 */	0,
/* 80 */	0,
/* 81 */	0,
/* 82 */	0,
/* 83 */	0,
/* 84 */	0,
/* 85 */	"CVCI",
/* 86 */	"CVCU",
/* 87 */	0,
/* 88 */	0,
/* 89 */	0,
/* 90 */	0,
/* 91 */	0,
/* 92 */	0,
/* 93 */	0,
/* 94 */	0,
/* 95 */	0,
/* 96 */	0,
/* 97 */	"CVDF",
/* 98 */	0,
/* 99 */	0,
/* 100 */	0,
/* 101 */	"CVDI",
/* 102 */	0,
/* 103 */	0,
/* 104 */	0,
/* 105 */	0,
/* 106 */	0,
/* 107 */	0,
/* 108 */	0,
/* 109 */	0,
/* 110 */	0,
/* 111 */	0,
/* 112 */	0,
/* 113 */	0,
/* 114 */	"CVFD",
/* 115 */	0,
/* 116 */	0,
/* 117 */	0,
/* 118 */	0,
/* 119 */	0,
/* 120 */	0,
/* 121 */	0,
/* 122 */	0,
/* 123 */	0,
/* 124 */	0,
/* 125 */	0,
/* 126 */	0,
/* 127 */	0,
/* 128 */	0,
/* 129 */	0,
/* 130 */	"CVID",
/* 131 */	"CVIC",
/* 132 */	"CVIS",
/* 133 */	0,
/* 134 */	"CVIU",
/* 135 */	0,
/* 136 */	0,
/* 137 */	0,
/* 138 */	0,
/* 139 */	0,
/* 140 */	0,
/* 141 */	0,
/* 142 */	0,
/* 143 */	0,
/* 144 */	0,
/* 145 */	0,
/* 146 */	0,
/* 147 */	0,
/* 148 */	0,
/* 149 */	0,
/* 150 */	"CVPU",
/* 151 */	0,
/* 152 */	0,
/* 153 */	0,
/* 154 */	0,
/* 155 */	0,
/* 156 */	0,
/* 157 */	0,
/* 158 */	0,
/* 159 */	0,
/* 160 */	0,
/* 161 */	0,
/* 162 */	0,
/* 163 */	0,
/* 164 */	0,
/* 165 */	"CVSI",
/* 166 */	"CVSU",
/* 167 */	0,
/* 168 */	0,
/* 169 */	0,
/* 170 */	0,
/* 171 */	0,
/* 172 */	0,
/* 173 */	0,
/* 174 */	0,
/* 175 */	0,
/* 176 */	0,
/* 177 */	0,
/* 178 */	0,
/* 179 */	"CVUC",
/* 180 */	"CVUS",
/* 181 */	"CVUI",
/* 182 */	0,
/* 183 */	"CVUP",
/* 184 */	0,
/* 185 */	0,
/* 186 */	0,
/* 187 */	0,
/* 188 */	0,
/* 189 */	0,
/* 190 */	0,
/* 191 */	0,
/* 192 */	0,
/* 193 */	"NEGF",
/* 194 */	"NEGD",
/* 195 */	0,
/* 196 */	0,
/* 197 */	"NEGI",
/* 198 */	0,
/* 199 */	0,
/* 200 */	0,
/* 201 */	0,
/* 202 */	0,
/* 203 */	0,
/* 204 */	0,
/* 205 */	0,
/* 206 */	0,
/* 207 */	0,
/* 208 */	0,
/* 209 */	"CALLF",
/* 210 */	"CALLD",
/* 211 */	0,
/* 212 */	0,
/* 213 */	"CALLI",
/* 214 */	0,
/* 215 */	0,
/* 216 */	"CALLV",
/* 217 */	"CALLB",
/* 218 */	0,
/* 219 */	0,
/* 220 */	0,
/* 221 */	0,
/* 222 */	0,
/* 223 */	0,
/* 224 */	0,
/* 225 */	"LOADF",
/* 226 */	"LOADD",
/* 227 */	"LOADC",
/* 228 */	"LOADS",
/* 229 */	"LOADI",
/* 230 */	"LOADU",
/* 231 */	"LOADP",
/* 232 */	0,
/* 233 */	"LOADB",
/* 234 */	0,
/* 235 */	0,
/* 236 */	0,
/* 237 */	0,
/* 238 */	0,
/* 239 */	0,
/* 240 */	0,
/* 241 */	"RETF",
/* 242 */	"RETD",
/* 243 */	0,
/* 244 */	0,
/* 245 */	"RETI",
/* 246 */	0,
/* 247 */	0,
/* 248 */	0,
/* 249 */	0,
/* 250 */	0,
/* 251 */	0,
/* 252 */	0,
/* 253 */	0,
/* 254 */	0,
/* 255 */	0,
/* 256 */	0,
/* 257 */	0,
/* 258 */	0,
/* 259 */	0,
/* 260 */	0,
/* 261 */	0,
/* 262 */	0,
/* 263 */	"ADDRGP",
/* 264 */	0,
/* 265 */	0,
/* 266 */	0,
/* 267 */	0,
/* 268 */	0,
/* 269 */	0,
/* 270 */	0,
/* 271 */	0,
/* 272 */	0,
/* 273 */	0,
/* 274 */	0,
/* 275 */	0,
/* 276 */	0,
/* 277 */	0,
/* 278 */	0,
/* 279 */	"ADDRFP",
/* 280 */	0,
/* 281 */	0,
/* 282 */	0,
/* 283 */	0,
/* 284 */	0,
/* 285 */	0,
/* 286 */	0,
/* 287 */	0,
/* 288 */	0,
/* 289 */	0,
/* 290 */	0,
/* 291 */	0,
/* 292 */	0,
/* 293 */	0,
/* 294 */	0,
/* 295 */	"ADDRLP",
/* 296 */	0,
/* 297 */	0,
/* 298 */	0,
/* 299 */	0,
/* 300 */	0,
/* 301 */	0,
/* 302 */	0,
/* 303 */	0,
/* 304 */	0,
/* 305 */	"ADDF",
/* 306 */	"ADDD",
/* 307 */	0,
/* 308 */	0,
/* 309 */	"ADDI",
/* 310 */	"ADDU",
/* 311 */	"ADDP",
/* 312 */	0,
/* 313 */	0,
/* 314 */	0,
/* 315 */	0,
/* 316 */	0,
/* 317 */	0,
/* 318 */	0,
/* 319 */	0,
/* 320 */	0,
/* 321 */	"SUBF",
/* 322 */	"SUBD",
/* 323 */	0,
/* 324 */	0,
/* 325 */	"SUBI",
/* 326 */	"SUBU",
/* 327 */	"SUBP",
/* 328 */	0,
/* 329 */	0,
/* 330 */	0,
/* 331 */	0,
/* 332 */	0,
/* 333 */	0,
/* 334 */	0,
/* 335 */	0,
/* 336 */	0,
/* 337 */	0,
/* 338 */	0,
/* 339 */	0,
/* 340 */	0,
/* 341 */	"LSHI",
/* 342 */	"LSHU",
/* 343 */	0,
/* 344 */	0,
/* 345 */	0,
/* 346 */	0,
/* 347 */	0,
/* 348 */	0,
/* 349 */	0,
/* 350 */	0,
/* 351 */	0,
/* 352 */	0,
/* 353 */	0,
/* 354 */	0,
/* 355 */	0,
/* 356 */	0,
/* 357 */	"MODI",
/* 358 */	"MODU",
/* 359 */	0,
/* 360 */	0,
/* 361 */	0,
/* 362 */	0,
/* 363 */	0,
/* 364 */	0,
/* 365 */	0,
/* 366 */	0,
/* 367 */	0,
/* 368 */	0,
/* 369 */	0,
/* 370 */	0,
/* 371 */	0,
/* 372 */	0,
/* 373 */	"RSHI",
/* 374 */	"RSHU",
/* 375 */	0,
/* 376 */	0,
/* 377 */	0,
/* 378 */	0,
/* 379 */	0,
/* 380 */	0,
/* 381 */	0,
/* 382 */	0,
/* 383 */	0,
/* 384 */	0,
/* 385 */	0,
/* 386 */	0,
/* 387 */	0,
/* 388 */	0,
/* 389 */	0,
/* 390 */	"BANDU",
/* 391 */	0,
/* 392 */	0,
/* 393 */	0,
/* 394 */	0,
/* 395 */	0,
/* 396 */	0,
/* 397 */	0,
/* 398 */	0,
/* 399 */	0,
/* 400 */	0,
/* 401 */	0,
/* 402 */	0,
/* 403 */	0,
/* 404 */	0,
/* 405 */	0,
/* 406 */	"BCOMU",
/* 407 */	0,
/* 408 */	0,
/* 409 */	0,
/* 410 */	0,
/* 411 */	0,
/* 412 */	0,
/* 413 */	0,
/* 414 */	0,
/* 415 */	0,
/* 416 */	0,
/* 417 */	0,
/* 418 */	0,
/* 419 */	0,
/* 420 */	0,
/* 421 */	0,
/* 422 */	"BORU",
/* 423 */	0,
/* 424 */	0,
/* 425 */	0,
/* 426 */	0,
/* 427 */	0,
/* 428 */	0,
/* 429 */	0,
/* 430 */	0,
/* 431 */	0,
/* 432 */	0,
/* 433 */	0,
/* 434 */	0,
/* 435 */	0,
/* 436 */	0,
/* 437 */	0,
/* 438 */	"BXORU",
/* 439 */	0,
/* 440 */	0,
/* 441 */	0,
/* 442 */	0,
/* 443 */	0,
/* 444 */	0,
/* 445 */	0,
/* 446 */	0,
/* 447 */	0,
/* 448 */	0,
/* 449 */	"DIVF",
/* 450 */	"DIVD",
/* 451 */	0,
/* 452 */	0,
/* 453 */	"DIVI",
/* 454 */	"DIVU",
/* 455 */	0,
/* 456 */	0,
/* 457 */	0,
/* 458 */	0,
/* 459 */	0,
/* 460 */	0,
/* 461 */	0,
/* 462 */	0,
/* 463 */	0,
/* 464 */	0,
/* 465 */	"MULF",
/* 466 */	"MULD",
/* 467 */	0,
/* 468 */	0,
/* 469 */	"MULI",
/* 470 */	"MULU",
/* 471 */	0,
/* 472 */	0,
/* 473 */	0,
/* 474 */	0,
/* 475 */	0,
/* 476 */	0,
/* 477 */	0,
/* 478 */	0,
/* 479 */	0,
/* 480 */	0,
/* 481 */	"EQF",
/* 482 */	"EQD",
/* 483 */	0,
/* 484 */	0,
/* 485 */	"EQI",
/* 486 */	0,
/* 487 */	0,
/* 488 */	0,
/* 489 */	0,
/* 490 */	0,
/* 491 */	0,
/* 492 */	0,
/* 493 */	0,
/* 494 */	0,
/* 495 */	0,
/* 496 */	0,
/* 497 */	"GEF",
/* 498 */	"GED",
/* 499 */	0,
/* 500 */	0,
/* 501 */	"GEI",
/* 502 */	"GEU",
/* 503 */	0,
/* 504 */	0,
/* 505 */	0,
/* 506 */	0,
/* 507 */	0,
/* 508 */	0,
/* 509 */	0,
/* 510 */	0,
/* 511 */	0,
/* 512 */	0,
/* 513 */	"GTF",
/* 514 */	"GTD",
/* 515 */	0,
/* 516 */	0,
/* 517 */	"GTI",
/* 518 */	"GTU",
/* 519 */	0,
/* 520 */	0,
/* 521 */	0,
/* 522 */	0,
/* 523 */	0,
/* 524 */	0,
/* 525 */	0,
/* 526 */	0,
/* 527 */	0,
/* 528 */	0,
/* 529 */	"LEF",
/* 530 */	"LED",
/* 531 */	0,
/* 532 */	0,
/* 533 */	"LEI",
/* 534 */	"LEU",
/* 535 */	0,
/* 536 */	0,
/* 537 */	0,
/* 538 */	0,
/* 539 */	0,
/* 540 */	0,
/* 541 */	0,
/* 542 */	0,
/* 543 */	0,
/* 544 */	0,
/* 545 */	"LTF",
/* 546 */	"LTD",
/* 547 */	0,
/* 548 */	0,
/* 549 */	"LTI",
/* 550 */	"LTU",
/* 551 */	0,
/* 552 */	0,
/* 553 */	0,
/* 554 */	0,
/* 555 */	0,
/* 556 */	0,
/* 557 */	0,
/* 558 */	0,
/* 559 */	0,
/* 560 */	0,
/* 561 */	"NEF",
/* 562 */	"NED",
/* 563 */	0,
/* 564 */	0,
/* 565 */	"NEI",
/* 566 */	0,
/* 567 */	0,
/* 568 */	0,
/* 569 */	0,
/* 570 */	0,
/* 571 */	0,
/* 572 */	0,
/* 573 */	0,
/* 574 */	0,
/* 575 */	0,
/* 576 */	0,
/* 577 */	0,
/* 578 */	0,
/* 579 */	0,
/* 580 */	0,
/* 581 */	0,
/* 582 */	0,
/* 583 */	0,
/* 584 */	"JUMPV",
/* 585 */	0,
/* 586 */	0,
/* 587 */	0,
/* 588 */	0,
/* 589 */	0,
/* 590 */	0,
/* 591 */	0,
/* 592 */	0,
/* 593 */	0,
/* 594 */	0,
/* 595 */	0,
/* 596 */	0,
/* 597 */	0,
/* 598 */	0,
/* 599 */	0,
/* 600 */	"LABELV",
/* 601 */	0,
/* 602 */	0,
/* 603 */	0,
/* 604 */	0,
/* 605 */	0,
/* 606 */	0,
/* 607 */	0,
/* 608 */	0,
/* 609 */	0,
/* 610 */	0,
/* 611 */	0,
/* 612 */	0,
/* 613 */	0,
/* 614 */	0,
/* 615 */	"VREGP",
};

static char *_templates[] = {
/* 0 */	0,
/* 1 */	"# read register\n",	/* reg: INDIRC(VREGP) */
/* 2 */	"# read register\n",	/* reg: INDIRD(VREGP) */
/* 3 */	"# read register\n",	/* reg: INDIRF(VREGP) */
/* 4 */	"# read register\n",	/* reg: INDIRI(VREGP) */
/* 5 */	"# read register\n",	/* reg: INDIRP(VREGP) */
/* 6 */	"# read register\n",	/* reg: INDIRS(VREGP) */
/* 7 */	"# write register\n",	/* stmt: ASGNC(VREGP,reg) */
/* 8 */	"# write register\n",	/* stmt: ASGND(VREGP,reg) */
/* 9 */	"# write register\n",	/* stmt: ASGNF(VREGP,reg) */
/* 10 */	"# write register\n",	/* stmt: ASGNI(VREGP,reg) */
/* 11 */	"# write register\n",	/* stmt: ASGNP(VREGP,reg) */
/* 12 */	"# write register\n",	/* stmt: ASGNS(VREGP,reg) */
/* 13 */	"%#%a",	/* con: CNSTC */
/* 14 */	"%#%a",	/* con: CNSTI */
/* 15 */	"%#%a",	/* con: CNSTP */
/* 16 */	"%#%a",	/* con: CNSTS */
/* 17 */	"%#%a",	/* con: CNSTU */
/* 18 */	"",	/* stmt: reg */
/* 19 */	"%0",	/* reg: CVIU(reg) */
/* 20 */	"%0",	/* reg: CVPU(reg) */
/* 21 */	"%0",	/* reg: CVUI(reg) */
/* 22 */	"%0",	/* reg: CVUP(reg) */
/* 23 */	"%#%a",	/* acon: ADDRGP */
/* 24 */	"%0",	/* acon: con */
/* 25 */	"%a+%F(SP)",	/* stk: ADDRFP */
/* 26 */	"%a+%F(SP)",	/* stk: ADDRLP */
/* 27 */	"# \tLD\t%c,%0\n",	/* reg: stk */
/* 28 */	"%0",	/* base: reg */
/* 29 */	"%0",	/* base: acon */
/* 30 */	"%0",	/* addr: base */
/* 31 */	"%0",	/* rc: reg */
/* 32 */	"%0",	/* rc: con */
/* 33 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRC(addr) */
/* 34 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRI(addr) */
/* 35 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRP(addr) */
/* 36 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRS(addr) */
/* 37 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRC(stk) */
/* 38 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRI(stk) */
/* 39 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRP(stk) */
/* 40 */	"# \tLD\t%c,(%0)\n",	/* reg: INDIRS(stk) */
/* 41 */	"\tLD\t%c,%0\n",	/* reg: addr */
/* 42 */	"\tLD\t%c,%0\n",	/* reg: rc */
/* 43 */	"\tLD\t%c,%0\n",	/* reg: LOADC(reg) */
/* 44 */	"# \tLD\t%c,%0\n",	/* reg: LOADI(reg) */
/* 45 */	"# \tLD\t%c,%0\n",	/* reg: LOADP(reg) */
/* 46 */	"# \tLD\t%c,%0\n",	/* reg: LOADS(reg) */
/* 47 */	"# \tLD\t%c,%0\n",	/* reg: LOADU(reg) */
/* 48 */	"# ?\tLD\t%c,%0\n\tADD\t%c,%1\n",	/* reg: ADDI(reg,rc) */
/* 49 */	"# ?\tLD\t%c,%0\n\tADD\t%c,%1\n",	/* reg: ADDP(reg,rc) */
/* 50 */	"# ?\tLD\t%c,%0\n\tADD\t%c,%1\n",	/* reg: ADDU(reg,rc) */
/* 51 */	"# ?\tLD\t%c,%0\n\tSUB\t%c,%1\n",	/* reg: SUBI(reg,rc) */
/* 52 */	"# ?\tLD\t%c,%0\n\tSUB\t%c,%1\n",	/* reg: SUBP(reg,rc) */
/* 53 */	"# ?\tLD\t%c,%0\n\tSUB\t%c,%1\n",	/* reg: SUBU(reg,rc) */
/* 54 */	"# ?\tLD\t%c,%0\n\tAND\t%c,%1\n",	/* reg: BANDU(reg,rc) */
/* 55 */	"# ?\tLD\t%c,%0\n\tOR\t%c,%1\n",	/* reg: BORU(reg,rc) */
/* 56 */	"# ?\tLD\t%c,%0\n\tXOR\t%c,%1\n",	/* reg: BXORU(reg,rc) */
/* 57 */	"# ?\tLD\t%c,%0\n\tCOM\t%c,%1\n",	/* reg: BCOMU(reg) */
/* 58 */	"# ?\tLD\t%c,%0\n\tNEG\t%c,%1\n",	/* reg: NEGI(reg) */
/* 59 */	"%a",	/* rc8: CNSTI */
/* 60 */	"%0",	/* rc8: reg */
/* 61 */	"# ?\tLD\t%c,%0\n\tLSHI\t%c,%1\n",	/* reg: LSHI(reg,rc8) */
/* 62 */	"# ?\tLD\t%c,%0\n\tLSHU\t%c,%1\n",	/* reg: LSHU(reg,rc8) */
/* 63 */	"# ?\tLD\t%c,%0\n\tRSHI\t%c,%1\n",	/* reg: RSHI(reg,rc8) */
/* 64 */	"# ?\tLD\t%c,%0\n\tRSHU\t%c,%1\n",	/* reg: RSHU(reg,rc8) */
/* 65 */	"\tCALL\t.mul\n",	/* reg: MULI(reg,reg) */
/* 66 */	"\tCALL\t.mulu\n",	/* reg: MULU(reg,reg) */
/* 67 */	"\tCALL\t.div\n",	/* reg: DIVI(reg,reg) */
/* 68 */	"\tCALL\t.divu\n",	/* reg: DIVU(reg,reg) */
/* 69 */	"\tCALL\t.mod\n",	/* reg: MODI(reg,reg) */
/* 70 */	"\tCALL\t.modu\n",	/* reg: MODU(reg,reg) */
/* 71 */	"# \tLD\t%c,%0\n",	/* reg: CVIU(reg) */
/* 72 */	"# \tLD\t%c,%0\n",	/* reg: CVPU(reg) */
/* 73 */	"# \tLD\t%c,%0\n",	/* reg: CVUI(reg) */
/* 74 */	"# \tLD\t%c,%0\n",	/* reg: CVUP(reg) */
/* 75 */	"# \tLD\t%c,%0\n",	/* reg: CVSI(reg) */
/* 76 */	"# \tLD\t%c,%0\n",	/* reg: CVSU(reg) */
/* 77 */	"# \tLD\t%c,%0\n",	/* reg: CVIS(reg) */
/* 78 */	"# \tLD\t%c,%0\n",	/* reg: CVUS(reg) */
/* 79 */	"# extend\n",	/* reg: CVCI(reg) */
/* 80 */	"# extend\n",	/* reg: CVCU(reg) */
/* 81 */	"# truncate\n",	/* reg: CVIC(reg) */
/* 82 */	"# truncate\n",	/* reg: CVUC(reg) */
/* 83 */	"%0",	/* rc5: con */
/* 84 */	"%0",	/* rc5: reg */
/* 85 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNC(addr,rc) */
/* 86 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNI(addr,rc) */
/* 87 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNP(addr,rc) */
/* 88 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNS(addr,rc) */
/* 89 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNC(stk,rc5) */
/* 90 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNI(stk,rc5) */
/* 91 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNP(stk,rc5) */
/* 92 */	"# \tLD\t(%0),%1\n",	/* stmt: ASGNS(stk,rc5) */
/* 93 */	"# \tPUSH\t%0\n",	/* stmt: ARGI(reg) */
/* 94 */	"# \tPUSH\t%0\n",	/* stmt: ARGP(reg) */
/* 95 */	"# ASGN struct\n",	/* stmt: ASGNB(reg,INDIRB(reg)) */
/* 96 */	"# ARG struct\n",	/* stmt: ARGB(INDIRB(reg)) */
/* 97 */	"# load double",	/* reg: INDIRD(addr) */
/* 98 */	"# load float",	/* reg: INDIRF(addr) */
/* 99 */	"# store double",	/* stmt: ASGND(addr,reg) */
/* 100 */	"# store float",	/* stmt: ASGNF(addr,reg) */
/* 101 */	"# double argument\n",	/* stmt: ARGD(reg) */
/* 102 */	"# float argument\n",	/* stmt: ARGF(reg) */
/* 103 */	"# invert double\n",	/* reg: NEGD(reg) */
/* 104 */	"# invert float\n",	/* reg: NEGF(reg) */
/* 105 */	"# add double\n",	/* reg: ADDD(reg,flt) */
/* 106 */	"# add float\n",	/* reg: ADDF(reg,flt) */
/* 107 */	"# div double\n",	/* reg: DIVD(reg,flt) */
/* 108 */	"# div float\n",	/* reg: DIVF(reg,flt) */
/* 109 */	"# mul double\n",	/* reg: MULD(reg,flt) */
/* 110 */	"# mul float\n",	/* reg: MULF(reg,flt) */
/* 111 */	"# sub double\n",	/* reg: SUBD(reg,flt) */
/* 112 */	"# sub float\n",	/* reg: SUBF(reg,flt) */
/* 113 */	"# CVFD\n",	/* reg: CVFD(reg) */
/* 114 */	"# CVDF\n",	/* reg: CVDF(reg) */
/* 115 */	"# CVID\n",	/* reg: CVID(reg) */
/* 116 */	"# CVDI\n",	/* reg: CVDI(reg) */
/* 117 */	"%a",	/* addrj: ADDRGP */
/* 118 */	"(%0)",	/* addrj: reg */
/* 119 */	"\tJP\t%0\n",	/* stmt: JUMPV(addrj) */
/* 120 */	"%a:\n",	/* stmt: LABELV */
/* 121 */	"# \tCP\t%0,%1\n\tJP\tZ,%a\n",	/* stmt: EQI(reg,rc) */
/* 122 */	"# \tCP\t%0,%1\n\tJP\tPZ,%a\n",	/* stmt: GEI(reg,rc) */
/* 123 */	"# \tCP\t%0,%1\n\tJP\tP,%a\n",	/* stmt: GTI(reg,rc) */
/* 124 */	"# \tCP\t%0,%1\n\tJP\tMZ,%a\n",	/* stmt: LEI(reg,rc) */
/* 125 */	"# \tCP\t%0,%1\n\tJP\tM,%a\n",	/* stmt: LTI(reg,rc) */
/* 126 */	"# \tCP\t%0,%1\n\tJP\tNZ,%a\n",	/* stmt: NEI(reg,rc) */
/* 127 */	"# \tCPU\t%0,%1\n\tJP\tPZ,%a\n",	/* stmt: GEU(reg,rc) */
/* 128 */	"# \tCPU\t%0,%1\n\tJP\tP,%a\n",	/* stmt: GTU(reg,rc) */
/* 129 */	"# \tCPU\t%0,%1\n\tJP\tMZ,%a\n",	/* stmt: LEU(reg,rc) */
/* 130 */	"# \tCPU\t%0,%1\n\tJP\tM,%a\n",	/* stmt: LTU(reg,rc) */
/* 131 */	"# compare double eq\n",	/* stmt: EQD(reg,reg) */
/* 132 */	"# compare double ge\n",	/* stmt: GED(reg,reg) */
/* 133 */	"# compare double gt\n",	/* stmt: GTD(reg,reg) */
/* 134 */	"# compare double le\n",	/* stmt: LED(reg,reg) */
/* 135 */	"# compare double lt\n",	/* stmt: LTD(reg,reg) */
/* 136 */	"# compare double ne\n",	/* stmt: NED(reg,reg) */
/* 137 */	"# compare float eq\n",	/* stmt: EQF(reg,reg) */
/* 138 */	"# compare float ge\n",	/* stmt: GEF(reg,reg) */
/* 139 */	"# compare float gt\n",	/* stmt: GTF(reg,reg) */
/* 140 */	"# compare float le\n",	/* stmt: LEF(reg,reg) */
/* 141 */	"# compare float lt\n",	/* stmt: LTF(reg,reg) */
/* 142 */	"# compare float ne\n",	/* stmt: NEF(reg,reg) */
/* 143 */	"# \tCALL\t%0\n",	/* reg: CALLI(addrj) */
/* 144 */	"# \tCALL\t%0\n",	/* stmt: CALLV(addrj) */
/* 145 */	"# \tCALL\t%0\n",	/* reg: CALLF(addrj) */
/* 146 */	"# \tCALL\t%0\n",	/* reg: CALLD(addrj) */
/* 147 */	"# ret\n",	/* stmt: RETI(reg) */
/* 148 */	"# ret\n",	/* stmt: RETF(reg) */
/* 149 */	"# ret\n",	/* stmt: RETD(reg) */
};

static char _isinstruction[] = {
/* 0 */	0,
/* 1 */	1,	/* # read register\n */
/* 2 */	1,	/* # read register\n */
/* 3 */	1,	/* # read register\n */
/* 4 */	1,	/* # read register\n */
/* 5 */	1,	/* # read register\n */
/* 6 */	1,	/* # read register\n */
/* 7 */	1,	/* # write register\n */
/* 8 */	1,	/* # write register\n */
/* 9 */	1,	/* # write register\n */
/* 10 */	1,	/* # write register\n */
/* 11 */	1,	/* # write register\n */
/* 12 */	1,	/* # write register\n */
/* 13 */	0,	/* %#%a */
/* 14 */	0,	/* %#%a */
/* 15 */	0,	/* %#%a */
/* 16 */	0,	/* %#%a */
/* 17 */	0,	/* %#%a */
/* 18 */	0,	/*  */
/* 19 */	0,	/* %0 */
/* 20 */	0,	/* %0 */
/* 21 */	0,	/* %0 */
/* 22 */	0,	/* %0 */
/* 23 */	0,	/* %#%a */
/* 24 */	0,	/* %0 */
/* 25 */	0,	/* %a+%F(SP) */
/* 26 */	0,	/* %a+%F(SP) */
/* 27 */	1,	/* # \tLD\t%c,%0\n */
/* 28 */	0,	/* %0 */
/* 29 */	0,	/* %0 */
/* 30 */	0,	/* %0 */
/* 31 */	0,	/* %0 */
/* 32 */	0,	/* %0 */
/* 33 */	1,	/* # \tLD\t%c,(%0)\n */
/* 34 */	1,	/* # \tLD\t%c,(%0)\n */
/* 35 */	1,	/* # \tLD\t%c,(%0)\n */
/* 36 */	1,	/* # \tLD\t%c,(%0)\n */
/* 37 */	1,	/* # \tLD\t%c,(%0)\n */
/* 38 */	1,	/* # \tLD\t%c,(%0)\n */
/* 39 */	1,	/* # \tLD\t%c,(%0)\n */
/* 40 */	1,	/* # \tLD\t%c,(%0)\n */
/* 41 */	1,	/* \tLD\t%c,%0\n */
/* 42 */	1,	/* \tLD\t%c,%0\n */
/* 43 */	1,	/* \tLD\t%c,%0\n */
/* 44 */	1,	/* # \tLD\t%c,%0\n */
/* 45 */	1,	/* # \tLD\t%c,%0\n */
/* 46 */	1,	/* # \tLD\t%c,%0\n */
/* 47 */	1,	/* # \tLD\t%c,%0\n */
/* 48 */	1,	/* # ?\tLD\t%c,%0\n\tADD\t%c,%1\n */
/* 49 */	1,	/* # ?\tLD\t%c,%0\n\tADD\t%c,%1\n */
/* 50 */	1,	/* # ?\tLD\t%c,%0\n\tADD\t%c,%1\n */
/* 51 */	1,	/* # ?\tLD\t%c,%0\n\tSUB\t%c,%1\n */
/* 52 */	1,	/* # ?\tLD\t%c,%0\n\tSUB\t%c,%1\n */
/* 53 */	1,	/* # ?\tLD\t%c,%0\n\tSUB\t%c,%1\n */
/* 54 */	1,	/* # ?\tLD\t%c,%0\n\tAND\t%c,%1\n */
/* 55 */	1,	/* # ?\tLD\t%c,%0\n\tOR\t%c,%1\n */
/* 56 */	1,	/* # ?\tLD\t%c,%0\n\tXOR\t%c,%1\n */
/* 57 */	1,	/* # ?\tLD\t%c,%0\n\tCOM\t%c,%1\n */
/* 58 */	1,	/* # ?\tLD\t%c,%0\n\tNEG\t%c,%1\n */
/* 59 */	0,	/* %a */
/* 60 */	0,	/* %0 */
/* 61 */	1,	/* # ?\tLD\t%c,%0\n\tLSHI\t%c,%1\n */
/* 62 */	1,	/* # ?\tLD\t%c,%0\n\tLSHU\t%c,%1\n */
/* 63 */	1,	/* # ?\tLD\t%c,%0\n\tRSHI\t%c,%1\n */
/* 64 */	1,	/* # ?\tLD\t%c,%0\n\tRSHU\t%c,%1\n */
/* 65 */	1,	/* \tCALL\t.mul\n */
/* 66 */	1,	/* \tCALL\t.mulu\n */
/* 67 */	1,	/* \tCALL\t.div\n */
/* 68 */	1,	/* \tCALL\t.divu\n */
/* 69 */	1,	/* \tCALL\t.mod\n */
/* 70 */	1,	/* \tCALL\t.modu\n */
/* 71 */	1,	/* # \tLD\t%c,%0\n */
/* 72 */	1,	/* # \tLD\t%c,%0\n */
/* 73 */	1,	/* # \tLD\t%c,%0\n */
/* 74 */	1,	/* # \tLD\t%c,%0\n */
/* 75 */	1,	/* # \tLD\t%c,%0\n */
/* 76 */	1,	/* # \tLD\t%c,%0\n */
/* 77 */	1,	/* # \tLD\t%c,%0\n */
/* 78 */	1,	/* # \tLD\t%c,%0\n */
/* 79 */	1,	/* # extend\n */
/* 80 */	1,	/* # extend\n */
/* 81 */	1,	/* # truncate\n */
/* 82 */	1,	/* # truncate\n */
/* 83 */	0,	/* %0 */
/* 84 */	0,	/* %0 */
/* 85 */	1,	/* # \tLD\t(%0),%1\n */
/* 86 */	1,	/* # \tLD\t(%0),%1\n */
/* 87 */	1,	/* # \tLD\t(%0),%1\n */
/* 88 */	1,	/* # \tLD\t(%0),%1\n */
/* 89 */	1,	/* # \tLD\t(%0),%1\n */
/* 90 */	1,	/* # \tLD\t(%0),%1\n */
/* 91 */	1,	/* # \tLD\t(%0),%1\n */
/* 92 */	1,	/* # \tLD\t(%0),%1\n */
/* 93 */	1,	/* # \tPUSH\t%0\n */
/* 94 */	1,	/* # \tPUSH\t%0\n */
/* 95 */	1,	/* # ASGN struct\n */
/* 96 */	1,	/* # ARG struct\n */
/* 97 */	0,	/* # load double */
/* 98 */	0,	/* # load float */
/* 99 */	0,	/* # store double */
/* 100 */	0,	/* # store float */
/* 101 */	1,	/* # double argument\n */
/* 102 */	1,	/* # float argument\n */
/* 103 */	1,	/* # invert double\n */
/* 104 */	1,	/* # invert float\n */
/* 105 */	1,	/* # add double\n */
/* 106 */	1,	/* # add float\n */
/* 107 */	1,	/* # div double\n */
/* 108 */	1,	/* # div float\n */
/* 109 */	1,	/* # mul double\n */
/* 110 */	1,	/* # mul float\n */
/* 111 */	1,	/* # sub double\n */
/* 112 */	1,	/* # sub float\n */
/* 113 */	1,	/* # CVFD\n */
/* 114 */	1,	/* # CVDF\n */
/* 115 */	1,	/* # CVID\n */
/* 116 */	1,	/* # CVDI\n */
/* 117 */	0,	/* %a */
/* 118 */	0,	/* (%0) */
/* 119 */	1,	/* \tJP\t%0\n */
/* 120 */	1,	/* %a:\n */
/* 121 */	1,	/* # \tCP\t%0,%1\n\tJP\tZ,%a\n */
/* 122 */	1,	/* # \tCP\t%0,%1\n\tJP\tPZ,%a\n */
/* 123 */	1,	/* # \tCP\t%0,%1\n\tJP\tP,%a\n */
/* 124 */	1,	/* # \tCP\t%0,%1\n\tJP\tMZ,%a\n */
/* 125 */	1,	/* # \tCP\t%0,%1\n\tJP\tM,%a\n */
/* 126 */	1,	/* # \tCP\t%0,%1\n\tJP\tNZ,%a\n */
/* 127 */	1,	/* # \tCPU\t%0,%1\n\tJP\tPZ,%a\n */
/* 128 */	1,	/* # \tCPU\t%0,%1\n\tJP\tP,%a\n */
/* 129 */	1,	/* # \tCPU\t%0,%1\n\tJP\tMZ,%a\n */
/* 130 */	1,	/* # \tCPU\t%0,%1\n\tJP\tM,%a\n */
/* 131 */	1,	/* # compare double eq\n */
/* 132 */	1,	/* # compare double ge\n */
/* 133 */	1,	/* # compare double gt\n */
/* 134 */	1,	/* # compare double le\n */
/* 135 */	1,	/* # compare double lt\n */
/* 136 */	1,	/* # compare double ne\n */
/* 137 */	1,	/* # compare float eq\n */
/* 138 */	1,	/* # compare float ge\n */
/* 139 */	1,	/* # compare float gt\n */
/* 140 */	1,	/* # compare float le\n */
/* 141 */	1,	/* # compare float lt\n */
/* 142 */	1,	/* # compare float ne\n */
/* 143 */	1,	/* # \tCALL\t%0\n */
/* 144 */	1,	/* # \tCALL\t%0\n */
/* 145 */	1,	/* # \tCALL\t%0\n */
/* 146 */	1,	/* # \tCALL\t%0\n */
/* 147 */	1,	/* # ret\n */
/* 148 */	1,	/* # ret\n */
/* 149 */	1,	/* # ret\n */
};

static char *_string[] = {
/* 0 */	0,
/* 1 */	"reg: INDIRC(VREGP)",
/* 2 */	"reg: INDIRD(VREGP)",
/* 3 */	"reg: INDIRF(VREGP)",
/* 4 */	"reg: INDIRI(VREGP)",
/* 5 */	"reg: INDIRP(VREGP)",
/* 6 */	"reg: INDIRS(VREGP)",
/* 7 */	"stmt: ASGNC(VREGP,reg)",
/* 8 */	"stmt: ASGND(VREGP,reg)",
/* 9 */	"stmt: ASGNF(VREGP,reg)",
/* 10 */	"stmt: ASGNI(VREGP,reg)",
/* 11 */	"stmt: ASGNP(VREGP,reg)",
/* 12 */	"stmt: ASGNS(VREGP,reg)",
/* 13 */	"con: CNSTC",
/* 14 */	"con: CNSTI",
/* 15 */	"con: CNSTP",
/* 16 */	"con: CNSTS",
/* 17 */	"con: CNSTU",
/* 18 */	"stmt: reg",
/* 19 */	"reg: CVIU(reg)",
/* 20 */	"reg: CVPU(reg)",
/* 21 */	"reg: CVUI(reg)",
/* 22 */	"reg: CVUP(reg)",
/* 23 */	"acon: ADDRGP",
/* 24 */	"acon: con",
/* 25 */	"stk: ADDRFP",
/* 26 */	"stk: ADDRLP",
/* 27 */	"reg: stk",
/* 28 */	"base: reg",
/* 29 */	"base: acon",
/* 30 */	"addr: base",
/* 31 */	"rc: reg",
/* 32 */	"rc: con",
/* 33 */	"reg: INDIRC(addr)",
/* 34 */	"reg: INDIRI(addr)",
/* 35 */	"reg: INDIRP(addr)",
/* 36 */	"reg: INDIRS(addr)",
/* 37 */	"reg: INDIRC(stk)",
/* 38 */	"reg: INDIRI(stk)",
/* 39 */	"reg: INDIRP(stk)",
/* 40 */	"reg: INDIRS(stk)",
/* 41 */	"reg: addr",
/* 42 */	"reg: rc",
/* 43 */	"reg: LOADC(reg)",
/* 44 */	"reg: LOADI(reg)",
/* 45 */	"reg: LOADP(reg)",
/* 46 */	"reg: LOADS(reg)",
/* 47 */	"reg: LOADU(reg)",
/* 48 */	"reg: ADDI(reg,rc)",
/* 49 */	"reg: ADDP(reg,rc)",
/* 50 */	"reg: ADDU(reg,rc)",
/* 51 */	"reg: SUBI(reg,rc)",
/* 52 */	"reg: SUBP(reg,rc)",
/* 53 */	"reg: SUBU(reg,rc)",
/* 54 */	"reg: BANDU(reg,rc)",
/* 55 */	"reg: BORU(reg,rc)",
/* 56 */	"reg: BXORU(reg,rc)",
/* 57 */	"reg: BCOMU(reg)",
/* 58 */	"reg: NEGI(reg)",
/* 59 */	"rc8: CNSTI",
/* 60 */	"rc8: reg",
/* 61 */	"reg: LSHI(reg,rc8)",
/* 62 */	"reg: LSHU(reg,rc8)",
/* 63 */	"reg: RSHI(reg,rc8)",
/* 64 */	"reg: RSHU(reg,rc8)",
/* 65 */	"reg: MULI(reg,reg)",
/* 66 */	"reg: MULU(reg,reg)",
/* 67 */	"reg: DIVI(reg,reg)",
/* 68 */	"reg: DIVU(reg,reg)",
/* 69 */	"reg: MODI(reg,reg)",
/* 70 */	"reg: MODU(reg,reg)",
/* 71 */	"reg: CVIU(reg)",
/* 72 */	"reg: CVPU(reg)",
/* 73 */	"reg: CVUI(reg)",
/* 74 */	"reg: CVUP(reg)",
/* 75 */	"reg: CVSI(reg)",
/* 76 */	"reg: CVSU(reg)",
/* 77 */	"reg: CVIS(reg)",
/* 78 */	"reg: CVUS(reg)",
/* 79 */	"reg: CVCI(reg)",
/* 80 */	"reg: CVCU(reg)",
/* 81 */	"reg: CVIC(reg)",
/* 82 */	"reg: CVUC(reg)",
/* 83 */	"rc5: con",
/* 84 */	"rc5: reg",
/* 85 */	"stmt: ASGNC(addr,rc)",
/* 86 */	"stmt: ASGNI(addr,rc)",
/* 87 */	"stmt: ASGNP(addr,rc)",
/* 88 */	"stmt: ASGNS(addr,rc)",
/* 89 */	"stmt: ASGNC(stk,rc5)",
/* 90 */	"stmt: ASGNI(stk,rc5)",
/* 91 */	"stmt: ASGNP(stk,rc5)",
/* 92 */	"stmt: ASGNS(stk,rc5)",
/* 93 */	"stmt: ARGI(reg)",
/* 94 */	"stmt: ARGP(reg)",
/* 95 */	"stmt: ASGNB(reg,INDIRB(reg))",
/* 96 */	"stmt: ARGB(INDIRB(reg))",
/* 97 */	"reg: INDIRD(addr)",
/* 98 */	"reg: INDIRF(addr)",
/* 99 */	"stmt: ASGND(addr,reg)",
/* 100 */	"stmt: ASGNF(addr,reg)",
/* 101 */	"stmt: ARGD(reg)",
/* 102 */	"stmt: ARGF(reg)",
/* 103 */	"reg: NEGD(reg)",
/* 104 */	"reg: NEGF(reg)",
/* 105 */	"reg: ADDD(reg,flt)",
/* 106 */	"reg: ADDF(reg,flt)",
/* 107 */	"reg: DIVD(reg,flt)",
/* 108 */	"reg: DIVF(reg,flt)",
/* 109 */	"reg: MULD(reg,flt)",
/* 110 */	"reg: MULF(reg,flt)",
/* 111 */	"reg: SUBD(reg,flt)",
/* 112 */	"reg: SUBF(reg,flt)",
/* 113 */	"reg: CVFD(reg)",
/* 114 */	"reg: CVDF(reg)",
/* 115 */	"reg: CVID(reg)",
/* 116 */	"reg: CVDI(reg)",
/* 117 */	"addrj: ADDRGP",
/* 118 */	"addrj: reg",
/* 119 */	"stmt: JUMPV(addrj)",
/* 120 */	"stmt: LABELV",
/* 121 */	"stmt: EQI(reg,rc)",
/* 122 */	"stmt: GEI(reg,rc)",
/* 123 */	"stmt: GTI(reg,rc)",
/* 124 */	"stmt: LEI(reg,rc)",
/* 125 */	"stmt: LTI(reg,rc)",
/* 126 */	"stmt: NEI(reg,rc)",
/* 127 */	"stmt: GEU(reg,rc)",
/* 128 */	"stmt: GTU(reg,rc)",
/* 129 */	"stmt: LEU(reg,rc)",
/* 130 */	"stmt: LTU(reg,rc)",
/* 131 */	"stmt: EQD(reg,reg)",
/* 132 */	"stmt: GED(reg,reg)",
/* 133 */	"stmt: GTD(reg,reg)",
/* 134 */	"stmt: LED(reg,reg)",
/* 135 */	"stmt: LTD(reg,reg)",
/* 136 */	"stmt: NED(reg,reg)",
/* 137 */	"stmt: EQF(reg,reg)",
/* 138 */	"stmt: GEF(reg,reg)",
/* 139 */	"stmt: GTF(reg,reg)",
/* 140 */	"stmt: LEF(reg,reg)",
/* 141 */	"stmt: LTF(reg,reg)",
/* 142 */	"stmt: NEF(reg,reg)",
/* 143 */	"reg: CALLI(addrj)",
/* 144 */	"stmt: CALLV(addrj)",
/* 145 */	"reg: CALLF(addrj)",
/* 146 */	"reg: CALLD(addrj)",
/* 147 */	"stmt: RETI(reg)",
/* 148 */	"stmt: RETF(reg)",
/* 149 */	"stmt: RETD(reg)",
};

static short _decode_stmt[] = {
	0,
	7,
	8,
	9,
	10,
	11,
	12,
	18,
	85,
	86,
	87,
	88,
	89,
	90,
	91,
	92,
	93,
	94,
	95,
	96,
	99,
	100,
	101,
	102,
	119,
	120,
	121,
	122,
	123,
	124,
	125,
	126,
	127,
	128,
	129,
	130,
	131,
	132,
	133,
	134,
	135,
	136,
	137,
	138,
	139,
	140,
	141,
	142,
	144,
	147,
	148,
	149,
};

static short _decode_reg[] = {
	0,
	1,
	2,
	3,
	4,
	5,
	6,
	19,
	20,
	21,
	22,
	27,
	33,
	34,
	35,
	36,
	37,
	38,
	39,
	40,
	41,
	42,
	43,
	44,
	45,
	46,
	47,
	48,
	49,
	50,
	51,
	52,
	53,
	54,
	55,
	56,
	57,
	58,
	61,
	62,
	63,
	64,
	65,
	66,
	67,
	68,
	69,
	70,
	71,
	72,
	73,
	74,
	75,
	76,
	77,
	78,
	79,
	80,
	81,
	82,
	97,
	98,
	103,
	104,
	105,
	106,
	107,
	108,
	109,
	110,
	111,
	112,
	113,
	114,
	115,
	116,
	143,
	145,
	146,
};

static short _decode_con[] = {
	0,
	13,
	14,
	15,
	16,
	17,
};

static short _decode_acon[] = {
	0,
	23,
	24,
};

static short _decode_stk[] = {
	0,
	25,
	26,
};

static short _decode_base[] = {
	0,
	28,
	29,
};

static short _decode_addr[] = {
	0,
	30,
};

static short _decode_rc[] = {
	0,
	31,
	32,
};

static short _decode_rc8[] = {
	0,
	59,
	60,
};

static short _decode_rc5[] = {
	0,
	83,
	84,
};

static short _decode_flt[] = {
	0,
};

static short _decode_addrj[] = {
	0,
	117,
	118,
};

static int _rule(state, goalnt) void *state; int goalnt; {
	if (goalnt < 1 || goalnt > 12)
		fatal("_rule", "Bad goal nonterminal %d\n", goalnt);
	if (!state)
		return 0;
	switch (goalnt) {
	case _stmt_NT:	return _decode_stmt[((struct _state *)state)->rule._stmt];
	case _reg_NT:	return _decode_reg[((struct _state *)state)->rule._reg];
	case _con_NT:	return _decode_con[((struct _state *)state)->rule._con];
	case _acon_NT:	return _decode_acon[((struct _state *)state)->rule._acon];
	case _stk_NT:	return _decode_stk[((struct _state *)state)->rule._stk];
	case _base_NT:	return _decode_base[((struct _state *)state)->rule._base];
	case _addr_NT:	return _decode_addr[((struct _state *)state)->rule._addr];
	case _rc_NT:	return _decode_rc[((struct _state *)state)->rule._rc];
	case _rc8_NT:	return _decode_rc8[((struct _state *)state)->rule._rc8];
	case _rc5_NT:	return _decode_rc5[((struct _state *)state)->rule._rc5];
	case _flt_NT:	return _decode_flt[((struct _state *)state)->rule._flt];
	case _addrj_NT:	return _decode_addrj[((struct _state *)state)->rule._addrj];
	default:
		fatal("_rule", "Bad goal nonterminal %d\n", goalnt);
		return 0;
	}
}

static void _closure_reg ARGS((NODEPTR_TYPE, int));
static void _closure_con ARGS((NODEPTR_TYPE, int));
static void _closure_acon ARGS((NODEPTR_TYPE, int));
static void _closure_stk ARGS((NODEPTR_TYPE, int));
static void _closure_base ARGS((NODEPTR_TYPE, int));
static void _closure_addr ARGS((NODEPTR_TYPE, int));
static void _closure_rc ARGS((NODEPTR_TYPE, int));

static void _closure_reg(a, c) NODEPTR_TYPE a; int c; {
	struct _state *p = STATE_LABEL(a);
	if (c + 2 < p->cost[_addrj_NT]) {
		p->cost[_addrj_NT] = c + 2;
		p->rule._addrj = 2;
	}
	if (c + 0 < p->cost[_rc5_NT]) {
		p->cost[_rc5_NT] = c + 0;
		p->rule._rc5 = 2;
	}
	if (c + 5 < p->cost[_rc8_NT]) {
		p->cost[_rc8_NT] = c + 5;
		p->rule._rc8 = 2;
	}
	if (c + 0 < p->cost[_rc_NT]) {
		p->cost[_rc_NT] = c + 0;
		p->rule._rc = 1;
		_closure_rc(a, c + 0);
	}
	if (c + 0 < p->cost[_base_NT]) {
		p->cost[_base_NT] = c + 0;
		p->rule._base = 1;
		_closure_base(a, c + 0);
	}
	if (c + 0 < p->cost[_stmt_NT]) {
		p->cost[_stmt_NT] = c + 0;
		p->rule._stmt = 7;
	}
}

static void _closure_con(a, c) NODEPTR_TYPE a; int c; {
	struct _state *p = STATE_LABEL(a);
	if (c + 5 < p->cost[_rc5_NT]) {
		p->cost[_rc5_NT] = c + 5;
		p->rule._rc5 = 1;
	}
	if (c + 0 < p->cost[_rc_NT]) {
		p->cost[_rc_NT] = c + 0;
		p->rule._rc = 2;
		_closure_rc(a, c + 0);
	}
	if (c + 0 < p->cost[_acon_NT]) {
		p->cost[_acon_NT] = c + 0;
		p->rule._acon = 2;
		_closure_acon(a, c + 0);
	}
}

static void _closure_acon(a, c) NODEPTR_TYPE a; int c; {
	struct _state *p = STATE_LABEL(a);
	if (c + 0 < p->cost[_base_NT]) {
		p->cost[_base_NT] = c + 0;
		p->rule._base = 2;
		_closure_base(a, c + 0);
	}
}

static void _closure_stk(a, c) NODEPTR_TYPE a; int c; {
	struct _state *p = STATE_LABEL(a);
	if (c + 3 < p->cost[_reg_NT]) {
		p->cost[_reg_NT] = c + 3;
		p->rule._reg = 11;
		_closure_reg(a, c + 3);
	}
}

static void _closure_base(a, c) NODEPTR_TYPE a; int c; {
	struct _state *p = STATE_LABEL(a);
	if (c + 0 < p->cost[_addr_NT]) {
		p->cost[_addr_NT] = c + 0;
		p->rule._addr = 1;
		_closure_addr(a, c + 0);
	}
}

static void _closure_addr(a, c) NODEPTR_TYPE a; int c; {
	struct _state *p = STATE_LABEL(a);
	if (c + 1 < p->cost[_reg_NT]) {
		p->cost[_reg_NT] = c + 1;
		p->rule._reg = 20;
		_closure_reg(a, c + 1);
	}
}

static void _closure_rc(a, c) NODEPTR_TYPE a; int c; {
	struct _state *p = STATE_LABEL(a);
	if (c + 1 < p->cost[_reg_NT]) {
		p->cost[_reg_NT] = c + 1;
		p->rule._reg = 21;
		_closure_reg(a, c + 1);
	}
}

static void _label(a) NODEPTR_TYPE a; {
	int c;
	struct _state *p;

	if (!a)
		fatal("_label", "Null tree\n", 0);
	STATE_LABEL(a) = p = allocate(sizeof *p, FUNC);
	p->rule._stmt = 0;
	p->cost[1] =
	p->cost[2] =
	p->cost[3] =
	p->cost[4] =
	p->cost[5] =
	p->cost[6] =
	p->cost[7] =
	p->cost[8] =
	p->cost[9] =
	p->cost[10] =
	p->cost[11] =
	p->cost[12] =
		0x7fff;
	switch (OP_LABEL(a)) {
	case 17: /* CNSTF */
		break;
	case 18: /* CNSTD */
		break;
	case 19: /* CNSTC */
		/* con: CNSTC */
		if (0 + 0 < p->cost[_con_NT]) {
			p->cost[_con_NT] = 0 + 0;
			p->rule._con = 1;
			_closure_con(a, 0 + 0);
		}
		break;
	case 20: /* CNSTS */
		/* con: CNSTS */
		if (0 + 0 < p->cost[_con_NT]) {
			p->cost[_con_NT] = 0 + 0;
			p->rule._con = 4;
			_closure_con(a, 0 + 0);
		}
		break;
	case 21: /* CNSTI */
		/* con: CNSTI */
		if (0 + 0 < p->cost[_con_NT]) {
			p->cost[_con_NT] = 0 + 0;
			p->rule._con = 2;
			_closure_con(a, 0 + 0);
		}
		/* rc8: CNSTI */
		c = (range(a, 0, 255));
		if (c + 0 < p->cost[_rc8_NT]) {
			p->cost[_rc8_NT] = c + 0;
			p->rule._rc8 = 1;
		}
		break;
	case 22: /* CNSTU */
		/* con: CNSTU */
		if (0 + 0 < p->cost[_con_NT]) {
			p->cost[_con_NT] = 0 + 0;
			p->rule._con = 5;
			_closure_con(a, 0 + 0);
		}
		break;
	case 23: /* CNSTP */
		/* con: CNSTP */
		if (0 + 0 < p->cost[_con_NT]) {
			p->cost[_con_NT] = 0 + 0;
			p->rule._con = 3;
			_closure_con(a, 0 + 0);
		}
		break;
	case 33: /* ARGF */
		_label(LEFT_CHILD(a));
		/* stmt: ARGF(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 23;
		}
		break;
	case 34: /* ARGD */
		_label(LEFT_CHILD(a));
		/* stmt: ARGD(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 22;
		}
		break;
	case 37: /* ARGI */
		_label(LEFT_CHILD(a));
		/* stmt: ARGI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 1;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 16;
		}
		break;
	case 39: /* ARGP */
		_label(LEFT_CHILD(a));
		/* stmt: ARGP(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 1;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 17;
		}
		break;
	case 41: /* ARGB */
		_label(LEFT_CHILD(a));
		if (	/* stmt: ARGB(INDIRB(reg)) */
			LEFT_CHILD(a)->op == 73 /* INDIRB */
		) {
			c = ((struct _state *)(LEFT_CHILD(LEFT_CHILD(a))->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 19;
			}
		}
		break;
	case 49: /* ASGNF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		if (	/* stmt: ASGNF(VREGP,reg) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			c = ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 3;
			}
		}
		/* stmt: ASGNF(addr,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 21;
		}
		break;
	case 50: /* ASGND */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		if (	/* stmt: ASGND(VREGP,reg) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			c = ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 2;
			}
		}
		/* stmt: ASGND(addr,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 20;
		}
		break;
	case 51: /* ASGNC */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		if (	/* stmt: ASGNC(VREGP,reg) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			c = ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 1;
			}
		}
		/* stmt: ASGNC(addr,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 3;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 8;
		}
		/* stmt: ASGNC(stk,rc5) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc5_NT] + 1;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 12;
		}
		break;
	case 52: /* ASGNS */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		if (	/* stmt: ASGNS(VREGP,reg) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			c = ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 6;
			}
		}
		/* stmt: ASGNS(addr,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 3;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 11;
		}
		/* stmt: ASGNS(stk,rc5) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc5_NT] + 1;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 15;
		}
		break;
	case 53: /* ASGNI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		if (	/* stmt: ASGNI(VREGP,reg) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			c = ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 4;
			}
		}
		/* stmt: ASGNI(addr,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 3;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 9;
		}
		/* stmt: ASGNI(stk,rc5) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc5_NT] + 1;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 13;
		}
		break;
	case 55: /* ASGNP */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		if (	/* stmt: ASGNP(VREGP,reg) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			c = ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 5;
			}
		}
		/* stmt: ASGNP(addr,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 3;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 10;
		}
		/* stmt: ASGNP(stk,rc5) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc5_NT] + 1;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 14;
		}
		break;
	case 57: /* ASGNB */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		if (	/* stmt: ASGNB(reg,INDIRB(reg)) */
			RIGHT_CHILD(a)->op == 73 /* INDIRB */
		) {
			c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(LEFT_CHILD(RIGHT_CHILD(a))->x.state))->cost[_reg_NT] + 0;
			if (c + 0 < p->cost[_stmt_NT]) {
				p->cost[_stmt_NT] = c + 0;
				p->rule._stmt = 18;
			}
		}
		break;
	case 65: /* INDIRF */
		_label(LEFT_CHILD(a));
		if (	/* reg: INDIRF(VREGP) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			if (mayrecalc(a)) {
				struct _state *q = a->syms[RX]->u.t.cse->x.state;
				if (q->cost[_stmt_NT] == 0) {
					p->cost[_stmt_NT] = 0;
					p->rule._stmt = q->rule._stmt;
				}
				if (q->cost[_reg_NT] == 0) {
					p->cost[_reg_NT] = 0;
					p->rule._reg = q->rule._reg;
				}
				if (q->cost[_con_NT] == 0) {
					p->cost[_con_NT] = 0;
					p->rule._con = q->rule._con;
				}
				if (q->cost[_acon_NT] == 0) {
					p->cost[_acon_NT] = 0;
					p->rule._acon = q->rule._acon;
				}
				if (q->cost[_stk_NT] == 0) {
					p->cost[_stk_NT] = 0;
					p->rule._stk = q->rule._stk;
				}
				if (q->cost[_base_NT] == 0) {
					p->cost[_base_NT] = 0;
					p->rule._base = q->rule._base;
				}
				if (q->cost[_addr_NT] == 0) {
					p->cost[_addr_NT] = 0;
					p->rule._addr = q->rule._addr;
				}
				if (q->cost[_rc_NT] == 0) {
					p->cost[_rc_NT] = 0;
					p->rule._rc = q->rule._rc;
				}
				if (q->cost[_rc8_NT] == 0) {
					p->cost[_rc8_NT] = 0;
					p->rule._rc8 = q->rule._rc8;
				}
				if (q->cost[_rc5_NT] == 0) {
					p->cost[_rc5_NT] = 0;
					p->rule._rc5 = q->rule._rc5;
				}
				if (q->cost[_flt_NT] == 0) {
					p->cost[_flt_NT] = 0;
					p->rule._flt = q->rule._flt;
				}
				if (q->cost[_addrj_NT] == 0) {
					p->cost[_addrj_NT] = 0;
					p->rule._addrj = q->rule._addrj;
				}
			}
			c = 0;
			if (c + 0 < p->cost[_reg_NT]) {
				p->cost[_reg_NT] = c + 0;
				p->rule._reg = 3;
				_closure_reg(a, c + 0);
			}
		}
		/* reg: INDIRF(addr) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 61;
			_closure_reg(a, c + 0);
		}
		break;
	case 66: /* INDIRD */
		_label(LEFT_CHILD(a));
		if (	/* reg: INDIRD(VREGP) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			if (mayrecalc(a)) {
				struct _state *q = a->syms[RX]->u.t.cse->x.state;
				if (q->cost[_stmt_NT] == 0) {
					p->cost[_stmt_NT] = 0;
					p->rule._stmt = q->rule._stmt;
				}
				if (q->cost[_reg_NT] == 0) {
					p->cost[_reg_NT] = 0;
					p->rule._reg = q->rule._reg;
				}
				if (q->cost[_con_NT] == 0) {
					p->cost[_con_NT] = 0;
					p->rule._con = q->rule._con;
				}
				if (q->cost[_acon_NT] == 0) {
					p->cost[_acon_NT] = 0;
					p->rule._acon = q->rule._acon;
				}
				if (q->cost[_stk_NT] == 0) {
					p->cost[_stk_NT] = 0;
					p->rule._stk = q->rule._stk;
				}
				if (q->cost[_base_NT] == 0) {
					p->cost[_base_NT] = 0;
					p->rule._base = q->rule._base;
				}
				if (q->cost[_addr_NT] == 0) {
					p->cost[_addr_NT] = 0;
					p->rule._addr = q->rule._addr;
				}
				if (q->cost[_rc_NT] == 0) {
					p->cost[_rc_NT] = 0;
					p->rule._rc = q->rule._rc;
				}
				if (q->cost[_rc8_NT] == 0) {
					p->cost[_rc8_NT] = 0;
					p->rule._rc8 = q->rule._rc8;
				}
				if (q->cost[_rc5_NT] == 0) {
					p->cost[_rc5_NT] = 0;
					p->rule._rc5 = q->rule._rc5;
				}
				if (q->cost[_flt_NT] == 0) {
					p->cost[_flt_NT] = 0;
					p->rule._flt = q->rule._flt;
				}
				if (q->cost[_addrj_NT] == 0) {
					p->cost[_addrj_NT] = 0;
					p->rule._addrj = q->rule._addrj;
				}
			}
			c = 0;
			if (c + 0 < p->cost[_reg_NT]) {
				p->cost[_reg_NT] = c + 0;
				p->rule._reg = 2;
				_closure_reg(a, c + 0);
			}
		}
		/* reg: INDIRD(addr) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 60;
			_closure_reg(a, c + 0);
		}
		break;
	case 67: /* INDIRC */
		_label(LEFT_CHILD(a));
		if (	/* reg: INDIRC(VREGP) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			if (mayrecalc(a)) {
				struct _state *q = a->syms[RX]->u.t.cse->x.state;
				if (q->cost[_stmt_NT] == 0) {
					p->cost[_stmt_NT] = 0;
					p->rule._stmt = q->rule._stmt;
				}
				if (q->cost[_reg_NT] == 0) {
					p->cost[_reg_NT] = 0;
					p->rule._reg = q->rule._reg;
				}
				if (q->cost[_con_NT] == 0) {
					p->cost[_con_NT] = 0;
					p->rule._con = q->rule._con;
				}
				if (q->cost[_acon_NT] == 0) {
					p->cost[_acon_NT] = 0;
					p->rule._acon = q->rule._acon;
				}
				if (q->cost[_stk_NT] == 0) {
					p->cost[_stk_NT] = 0;
					p->rule._stk = q->rule._stk;
				}
				if (q->cost[_base_NT] == 0) {
					p->cost[_base_NT] = 0;
					p->rule._base = q->rule._base;
				}
				if (q->cost[_addr_NT] == 0) {
					p->cost[_addr_NT] = 0;
					p->rule._addr = q->rule._addr;
				}
				if (q->cost[_rc_NT] == 0) {
					p->cost[_rc_NT] = 0;
					p->rule._rc = q->rule._rc;
				}
				if (q->cost[_rc8_NT] == 0) {
					p->cost[_rc8_NT] = 0;
					p->rule._rc8 = q->rule._rc8;
				}
				if (q->cost[_rc5_NT] == 0) {
					p->cost[_rc5_NT] = 0;
					p->rule._rc5 = q->rule._rc5;
				}
				if (q->cost[_flt_NT] == 0) {
					p->cost[_flt_NT] = 0;
					p->rule._flt = q->rule._flt;
				}
				if (q->cost[_addrj_NT] == 0) {
					p->cost[_addrj_NT] = 0;
					p->rule._addrj = q->rule._addrj;
				}
			}
			c = 0;
			if (c + 0 < p->cost[_reg_NT]) {
				p->cost[_reg_NT] = c + 0;
				p->rule._reg = 1;
				_closure_reg(a, c + 0);
			}
		}
		/* reg: INDIRC(addr) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + 3;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 12;
			_closure_reg(a, c + 0);
		}
		/* reg: INDIRC(stk) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 16;
			_closure_reg(a, c + 0);
		}
		break;
	case 68: /* INDIRS */
		_label(LEFT_CHILD(a));
		if (	/* reg: INDIRS(VREGP) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			if (mayrecalc(a)) {
				struct _state *q = a->syms[RX]->u.t.cse->x.state;
				if (q->cost[_stmt_NT] == 0) {
					p->cost[_stmt_NT] = 0;
					p->rule._stmt = q->rule._stmt;
				}
				if (q->cost[_reg_NT] == 0) {
					p->cost[_reg_NT] = 0;
					p->rule._reg = q->rule._reg;
				}
				if (q->cost[_con_NT] == 0) {
					p->cost[_con_NT] = 0;
					p->rule._con = q->rule._con;
				}
				if (q->cost[_acon_NT] == 0) {
					p->cost[_acon_NT] = 0;
					p->rule._acon = q->rule._acon;
				}
				if (q->cost[_stk_NT] == 0) {
					p->cost[_stk_NT] = 0;
					p->rule._stk = q->rule._stk;
				}
				if (q->cost[_base_NT] == 0) {
					p->cost[_base_NT] = 0;
					p->rule._base = q->rule._base;
				}
				if (q->cost[_addr_NT] == 0) {
					p->cost[_addr_NT] = 0;
					p->rule._addr = q->rule._addr;
				}
				if (q->cost[_rc_NT] == 0) {
					p->cost[_rc_NT] = 0;
					p->rule._rc = q->rule._rc;
				}
				if (q->cost[_rc8_NT] == 0) {
					p->cost[_rc8_NT] = 0;
					p->rule._rc8 = q->rule._rc8;
				}
				if (q->cost[_rc5_NT] == 0) {
					p->cost[_rc5_NT] = 0;
					p->rule._rc5 = q->rule._rc5;
				}
				if (q->cost[_flt_NT] == 0) {
					p->cost[_flt_NT] = 0;
					p->rule._flt = q->rule._flt;
				}
				if (q->cost[_addrj_NT] == 0) {
					p->cost[_addrj_NT] = 0;
					p->rule._addrj = q->rule._addrj;
				}
			}
			c = 0;
			if (c + 0 < p->cost[_reg_NT]) {
				p->cost[_reg_NT] = c + 0;
				p->rule._reg = 6;
				_closure_reg(a, c + 0);
			}
		}
		/* reg: INDIRS(addr) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + 3;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 15;
			_closure_reg(a, c + 0);
		}
		/* reg: INDIRS(stk) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 19;
			_closure_reg(a, c + 0);
		}
		break;
	case 69: /* INDIRI */
		_label(LEFT_CHILD(a));
		if (	/* reg: INDIRI(VREGP) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			if (mayrecalc(a)) {
				struct _state *q = a->syms[RX]->u.t.cse->x.state;
				if (q->cost[_stmt_NT] == 0) {
					p->cost[_stmt_NT] = 0;
					p->rule._stmt = q->rule._stmt;
				}
				if (q->cost[_reg_NT] == 0) {
					p->cost[_reg_NT] = 0;
					p->rule._reg = q->rule._reg;
				}
				if (q->cost[_con_NT] == 0) {
					p->cost[_con_NT] = 0;
					p->rule._con = q->rule._con;
				}
				if (q->cost[_acon_NT] == 0) {
					p->cost[_acon_NT] = 0;
					p->rule._acon = q->rule._acon;
				}
				if (q->cost[_stk_NT] == 0) {
					p->cost[_stk_NT] = 0;
					p->rule._stk = q->rule._stk;
				}
				if (q->cost[_base_NT] == 0) {
					p->cost[_base_NT] = 0;
					p->rule._base = q->rule._base;
				}
				if (q->cost[_addr_NT] == 0) {
					p->cost[_addr_NT] = 0;
					p->rule._addr = q->rule._addr;
				}
				if (q->cost[_rc_NT] == 0) {
					p->cost[_rc_NT] = 0;
					p->rule._rc = q->rule._rc;
				}
				if (q->cost[_rc8_NT] == 0) {
					p->cost[_rc8_NT] = 0;
					p->rule._rc8 = q->rule._rc8;
				}
				if (q->cost[_rc5_NT] == 0) {
					p->cost[_rc5_NT] = 0;
					p->rule._rc5 = q->rule._rc5;
				}
				if (q->cost[_flt_NT] == 0) {
					p->cost[_flt_NT] = 0;
					p->rule._flt = q->rule._flt;
				}
				if (q->cost[_addrj_NT] == 0) {
					p->cost[_addrj_NT] = 0;
					p->rule._addrj = q->rule._addrj;
				}
			}
			c = 0;
			if (c + 0 < p->cost[_reg_NT]) {
				p->cost[_reg_NT] = c + 0;
				p->rule._reg = 4;
				_closure_reg(a, c + 0);
			}
		}
		/* reg: INDIRI(addr) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + 3;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 13;
			_closure_reg(a, c + 0);
		}
		/* reg: INDIRI(stk) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 17;
			_closure_reg(a, c + 0);
		}
		break;
	case 71: /* INDIRP */
		_label(LEFT_CHILD(a));
		if (	/* reg: INDIRP(VREGP) */
			LEFT_CHILD(a)->op == 615 /* VREGP */
		) {
			if (mayrecalc(a)) {
				struct _state *q = a->syms[RX]->u.t.cse->x.state;
				if (q->cost[_stmt_NT] == 0) {
					p->cost[_stmt_NT] = 0;
					p->rule._stmt = q->rule._stmt;
				}
				if (q->cost[_reg_NT] == 0) {
					p->cost[_reg_NT] = 0;
					p->rule._reg = q->rule._reg;
				}
				if (q->cost[_con_NT] == 0) {
					p->cost[_con_NT] = 0;
					p->rule._con = q->rule._con;
				}
				if (q->cost[_acon_NT] == 0) {
					p->cost[_acon_NT] = 0;
					p->rule._acon = q->rule._acon;
				}
				if (q->cost[_stk_NT] == 0) {
					p->cost[_stk_NT] = 0;
					p->rule._stk = q->rule._stk;
				}
				if (q->cost[_base_NT] == 0) {
					p->cost[_base_NT] = 0;
					p->rule._base = q->rule._base;
				}
				if (q->cost[_addr_NT] == 0) {
					p->cost[_addr_NT] = 0;
					p->rule._addr = q->rule._addr;
				}
				if (q->cost[_rc_NT] == 0) {
					p->cost[_rc_NT] = 0;
					p->rule._rc = q->rule._rc;
				}
				if (q->cost[_rc8_NT] == 0) {
					p->cost[_rc8_NT] = 0;
					p->rule._rc8 = q->rule._rc8;
				}
				if (q->cost[_rc5_NT] == 0) {
					p->cost[_rc5_NT] = 0;
					p->rule._rc5 = q->rule._rc5;
				}
				if (q->cost[_flt_NT] == 0) {
					p->cost[_flt_NT] = 0;
					p->rule._flt = q->rule._flt;
				}
				if (q->cost[_addrj_NT] == 0) {
					p->cost[_addrj_NT] = 0;
					p->rule._addrj = q->rule._addrj;
				}
			}
			c = 0;
			if (c + 0 < p->cost[_reg_NT]) {
				p->cost[_reg_NT] = c + 0;
				p->rule._reg = 5;
				_closure_reg(a, c + 0);
			}
		}
		/* reg: INDIRP(addr) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addr_NT] + 3;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 14;
			_closure_reg(a, c + 0);
		}
		/* reg: INDIRP(stk) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_stk_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 18;
			_closure_reg(a, c + 0);
		}
		break;
	case 73: /* INDIRB */
		_label(LEFT_CHILD(a));
		break;
	case 85: /* CVCI */
		_label(LEFT_CHILD(a));
		/* reg: CVCI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 3;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 56;
			_closure_reg(a, c + 0);
		}
		break;
	case 86: /* CVCU */
		_label(LEFT_CHILD(a));
		/* reg: CVCU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 3;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 57;
			_closure_reg(a, c + 0);
		}
		break;
	case 97: /* CVDF */
		_label(LEFT_CHILD(a));
		/* reg: CVDF(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 73;
			_closure_reg(a, c + 0);
		}
		break;
	case 101: /* CVDI */
		_label(LEFT_CHILD(a));
		/* reg: CVDI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 75;
			_closure_reg(a, c + 0);
		}
		break;
	case 114: /* CVFD */
		_label(LEFT_CHILD(a));
		/* reg: CVFD(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 72;
			_closure_reg(a, c + 0);
		}
		break;
	case 130: /* CVID */
		_label(LEFT_CHILD(a));
		/* reg: CVID(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 74;
			_closure_reg(a, c + 0);
		}
		break;
	case 131: /* CVIC */
		_label(LEFT_CHILD(a));
		/* reg: CVIC(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 58;
			_closure_reg(a, c + 0);
		}
		break;
	case 132: /* CVIS */
		_label(LEFT_CHILD(a));
		/* reg: CVIS(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 54;
			_closure_reg(a, c + 0);
		}
		break;
	case 134: /* CVIU */
		_label(LEFT_CHILD(a));
		/* reg: CVIU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (notarget(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 7;
			_closure_reg(a, c + 0);
		}
		/* reg: CVIU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 48;
			_closure_reg(a, c + 0);
		}
		break;
	case 150: /* CVPU */
		_label(LEFT_CHILD(a));
		/* reg: CVPU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (notarget(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 8;
			_closure_reg(a, c + 0);
		}
		/* reg: CVPU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 49;
			_closure_reg(a, c + 0);
		}
		break;
	case 165: /* CVSI */
		_label(LEFT_CHILD(a));
		/* reg: CVSI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 52;
			_closure_reg(a, c + 0);
		}
		break;
	case 166: /* CVSU */
		_label(LEFT_CHILD(a));
		/* reg: CVSU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 53;
			_closure_reg(a, c + 0);
		}
		break;
	case 179: /* CVUC */
		_label(LEFT_CHILD(a));
		/* reg: CVUC(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 59;
			_closure_reg(a, c + 0);
		}
		break;
	case 180: /* CVUS */
		_label(LEFT_CHILD(a));
		/* reg: CVUS(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 55;
			_closure_reg(a, c + 0);
		}
		break;
	case 181: /* CVUI */
		_label(LEFT_CHILD(a));
		/* reg: CVUI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (notarget(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 9;
			_closure_reg(a, c + 0);
		}
		/* reg: CVUI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 50;
			_closure_reg(a, c + 0);
		}
		break;
	case 183: /* CVUP */
		_label(LEFT_CHILD(a));
		/* reg: CVUP(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (notarget(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 10;
			_closure_reg(a, c + 0);
		}
		/* reg: CVUP(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 51;
			_closure_reg(a, c + 0);
		}
		break;
	case 193: /* NEGF */
		_label(LEFT_CHILD(a));
		/* reg: NEGF(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 63;
			_closure_reg(a, c + 0);
		}
		break;
	case 194: /* NEGD */
		_label(LEFT_CHILD(a));
		/* reg: NEGD(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 62;
			_closure_reg(a, c + 0);
		}
		break;
	case 197: /* NEGI */
		_label(LEFT_CHILD(a));
		/* reg: NEGI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 37;
			_closure_reg(a, c + 0);
		}
		break;
	case 209: /* CALLF */
		_label(LEFT_CHILD(a));
		/* reg: CALLF(addrj) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addrj_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 77;
			_closure_reg(a, c + 0);
		}
		break;
	case 210: /* CALLD */
		_label(LEFT_CHILD(a));
		/* reg: CALLD(addrj) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addrj_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 78;
			_closure_reg(a, c + 0);
		}
		break;
	case 213: /* CALLI */
		_label(LEFT_CHILD(a));
		/* reg: CALLI(addrj) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addrj_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 76;
			_closure_reg(a, c + 0);
		}
		break;
	case 216: /* CALLV */
		_label(LEFT_CHILD(a));
		/* stmt: CALLV(addrj) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addrj_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 48;
		}
		break;
	case 217: /* CALLB */
		break;
	case 225: /* LOADF */
		break;
	case 226: /* LOADD */
		break;
	case 227: /* LOADC */
		_label(LEFT_CHILD(a));
		/* reg: LOADC(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 22;
			_closure_reg(a, c + 0);
		}
		break;
	case 228: /* LOADS */
		_label(LEFT_CHILD(a));
		/* reg: LOADS(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 25;
			_closure_reg(a, c + 0);
		}
		break;
	case 229: /* LOADI */
		_label(LEFT_CHILD(a));
		/* reg: LOADI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 23;
			_closure_reg(a, c + 0);
		}
		break;
	case 230: /* LOADU */
		_label(LEFT_CHILD(a));
		/* reg: LOADU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 26;
			_closure_reg(a, c + 0);
		}
		break;
	case 231: /* LOADP */
		_label(LEFT_CHILD(a));
		/* reg: LOADP(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + (move(a));
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 24;
			_closure_reg(a, c + 0);
		}
		break;
	case 233: /* LOADB */
		break;
	case 241: /* RETF */
		_label(LEFT_CHILD(a));
		/* stmt: RETF(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 50;
		}
		break;
	case 242: /* RETD */
		_label(LEFT_CHILD(a));
		/* stmt: RETD(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 51;
		}
		break;
	case 245: /* RETI */
		_label(LEFT_CHILD(a));
		/* stmt: RETI(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 49;
		}
		break;
	case 263: /* ADDRGP */
		/* acon: ADDRGP */
		if (0 + 0 < p->cost[_acon_NT]) {
			p->cost[_acon_NT] = 0 + 0;
			p->rule._acon = 1;
			_closure_acon(a, 0 + 0);
		}
		/* addrj: ADDRGP */
		if (0 + 0 < p->cost[_addrj_NT]) {
			p->cost[_addrj_NT] = 0 + 0;
			p->rule._addrj = 1;
		}
		break;
	case 279: /* ADDRFP */
		/* stk: ADDRFP */
		if (0 + 0 < p->cost[_stk_NT]) {
			p->cost[_stk_NT] = 0 + 0;
			p->rule._stk = 1;
			_closure_stk(a, 0 + 0);
		}
		break;
	case 295: /* ADDRLP */
		/* stk: ADDRLP */
		if (0 + 0 < p->cost[_stk_NT]) {
			p->cost[_stk_NT] = 0 + 0;
			p->rule._stk = 2;
			_closure_stk(a, 0 + 0);
		}
		break;
	case 305: /* ADDF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: ADDF(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 65;
			_closure_reg(a, c + 0);
		}
		break;
	case 306: /* ADDD */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: ADDD(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 64;
			_closure_reg(a, c + 0);
		}
		break;
	case 309: /* ADDI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: ADDI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 27;
			_closure_reg(a, c + 0);
		}
		break;
	case 310: /* ADDU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: ADDU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 29;
			_closure_reg(a, c + 0);
		}
		break;
	case 311: /* ADDP */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: ADDP(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 28;
			_closure_reg(a, c + 0);
		}
		break;
	case 321: /* SUBF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: SUBF(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 71;
			_closure_reg(a, c + 0);
		}
		break;
	case 322: /* SUBD */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: SUBD(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 70;
			_closure_reg(a, c + 0);
		}
		break;
	case 325: /* SUBI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: SUBI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 30;
			_closure_reg(a, c + 0);
		}
		break;
	case 326: /* SUBU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: SUBU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 32;
			_closure_reg(a, c + 0);
		}
		break;
	case 327: /* SUBP */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: SUBP(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 31;
			_closure_reg(a, c + 0);
		}
		break;
	case 341: /* LSHI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: LSHI(reg,rc8) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc8_NT] + 2;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 38;
			_closure_reg(a, c + 0);
		}
		break;
	case 342: /* LSHU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: LSHU(reg,rc8) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc8_NT] + 2;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 39;
			_closure_reg(a, c + 0);
		}
		break;
	case 357: /* MODI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: MODI(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 14;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 46;
			_closure_reg(a, c + 0);
		}
		break;
	case 358: /* MODU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: MODU(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 14;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 47;
			_closure_reg(a, c + 0);
		}
		break;
	case 373: /* RSHI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: RSHI(reg,rc8) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc8_NT] + 2;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 40;
			_closure_reg(a, c + 0);
		}
		break;
	case 374: /* RSHU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: RSHU(reg,rc8) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc8_NT] + 2;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 41;
			_closure_reg(a, c + 0);
		}
		break;
	case 390: /* BANDU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: BANDU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 33;
			_closure_reg(a, c + 0);
		}
		break;
	case 406: /* BCOMU */
		_label(LEFT_CHILD(a));
		/* reg: BCOMU(reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 36;
			_closure_reg(a, c + 0);
		}
		break;
	case 422: /* BORU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: BORU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 34;
			_closure_reg(a, c + 0);
		}
		break;
	case 438: /* BXORU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: BXORU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 1;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 35;
			_closure_reg(a, c + 0);
		}
		break;
	case 449: /* DIVF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: DIVF(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 67;
			_closure_reg(a, c + 0);
		}
		break;
	case 450: /* DIVD */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: DIVD(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 66;
			_closure_reg(a, c + 0);
		}
		break;
	case 453: /* DIVI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: DIVI(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 14;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 44;
			_closure_reg(a, c + 0);
		}
		break;
	case 454: /* DIVU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: DIVU(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 14;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 45;
			_closure_reg(a, c + 0);
		}
		break;
	case 465: /* MULF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: MULF(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 69;
			_closure_reg(a, c + 0);
		}
		break;
	case 466: /* MULD */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: MULD(reg,flt) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_flt_NT] + 0;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 68;
			_closure_reg(a, c + 0);
		}
		break;
	case 469: /* MULI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: MULI(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 14;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 42;
			_closure_reg(a, c + 0);
		}
		break;
	case 470: /* MULU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* reg: MULU(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 14;
		if (c + 0 < p->cost[_reg_NT]) {
			p->cost[_reg_NT] = c + 0;
			p->rule._reg = 43;
			_closure_reg(a, c + 0);
		}
		break;
	case 481: /* EQF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: EQF(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 42;
		}
		break;
	case 482: /* EQD */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: EQD(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 36;
		}
		break;
	case 485: /* EQI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: EQI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 26;
		}
		break;
	case 497: /* GEF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GEF(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 43;
		}
		break;
	case 498: /* GED */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GED(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 37;
		}
		break;
	case 501: /* GEI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GEI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 27;
		}
		break;
	case 502: /* GEU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GEU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 32;
		}
		break;
	case 513: /* GTF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GTF(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 44;
		}
		break;
	case 514: /* GTD */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GTD(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 38;
		}
		break;
	case 517: /* GTI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GTI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 28;
		}
		break;
	case 518: /* GTU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: GTU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 33;
		}
		break;
	case 529: /* LEF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LEF(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 45;
		}
		break;
	case 530: /* LED */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LED(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 39;
		}
		break;
	case 533: /* LEI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LEI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 29;
		}
		break;
	case 534: /* LEU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LEU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 34;
		}
		break;
	case 545: /* LTF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LTF(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 46;
		}
		break;
	case 546: /* LTD */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LTD(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 40;
		}
		break;
	case 549: /* LTI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LTI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 30;
		}
		break;
	case 550: /* LTU */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: LTU(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 35;
		}
		break;
	case 561: /* NEF */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: NEF(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 47;
		}
		break;
	case 562: /* NED */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: NED(reg,reg) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_reg_NT] + 0;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 41;
		}
		break;
	case 565: /* NEI */
		_label(LEFT_CHILD(a));
		_label(RIGHT_CHILD(a));
		/* stmt: NEI(reg,rc) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_reg_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_rc_NT] + 4;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 31;
		}
		break;
	case 584: /* JUMPV */
		_label(LEFT_CHILD(a));
		/* stmt: JUMPV(addrj) */
		c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_addrj_NT] + 3;
		if (c + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = c + 0;
			p->rule._stmt = 24;
		}
		break;
	case 600: /* LABELV */
		/* stmt: LABELV */
		if (0 + 0 < p->cost[_stmt_NT]) {
			p->cost[_stmt_NT] = 0 + 0;
			p->rule._stmt = 25;
		}
		break;
	case 615: /* VREGP */
		break;
	default:
		fatal("_label", "Bad terminal %d\n", OP_LABEL(a));
	}
}

static void _kids(p, eruleno, kids) NODEPTR_TYPE p, kids[]; int eruleno; {
	if (!p)
		fatal("_kids", "Null tree\n", 0);
	if (!kids)
		fatal("_kids", "Null kids\n", 0);
	switch (eruleno) {
	case 120: /* stmt: LABELV */
	case 117: /* addrj: ADDRGP */
	case 59: /* rc8: CNSTI */
	case 26: /* stk: ADDRLP */
	case 25: /* stk: ADDRFP */
	case 23: /* acon: ADDRGP */
	case 17: /* con: CNSTU */
	case 16: /* con: CNSTS */
	case 15: /* con: CNSTP */
	case 14: /* con: CNSTI */
	case 13: /* con: CNSTC */
	case 6: /* reg: INDIRS(VREGP) */
	case 5: /* reg: INDIRP(VREGP) */
	case 4: /* reg: INDIRI(VREGP) */
	case 3: /* reg: INDIRF(VREGP) */
	case 2: /* reg: INDIRD(VREGP) */
	case 1: /* reg: INDIRC(VREGP) */
		break;
	case 12: /* stmt: ASGNS(VREGP,reg) */
	case 11: /* stmt: ASGNP(VREGP,reg) */
	case 10: /* stmt: ASGNI(VREGP,reg) */
	case 9: /* stmt: ASGNF(VREGP,reg) */
	case 8: /* stmt: ASGND(VREGP,reg) */
	case 7: /* stmt: ASGNC(VREGP,reg) */
		kids[0] = RIGHT_CHILD(p);
		break;
	case 118: /* addrj: reg */
	case 84: /* rc5: reg */
	case 83: /* rc5: con */
	case 60: /* rc8: reg */
	case 42: /* reg: rc */
	case 41: /* reg: addr */
	case 32: /* rc: con */
	case 31: /* rc: reg */
	case 30: /* addr: base */
	case 29: /* base: acon */
	case 28: /* base: reg */
	case 27: /* reg: stk */
	case 24: /* acon: con */
	case 18: /* stmt: reg */
		kids[0] = p;
		break;
	case 149: /* stmt: RETD(reg) */
	case 148: /* stmt: RETF(reg) */
	case 147: /* stmt: RETI(reg) */
	case 146: /* reg: CALLD(addrj) */
	case 145: /* reg: CALLF(addrj) */
	case 144: /* stmt: CALLV(addrj) */
	case 143: /* reg: CALLI(addrj) */
	case 119: /* stmt: JUMPV(addrj) */
	case 116: /* reg: CVDI(reg) */
	case 115: /* reg: CVID(reg) */
	case 114: /* reg: CVDF(reg) */
	case 113: /* reg: CVFD(reg) */
	case 104: /* reg: NEGF(reg) */
	case 103: /* reg: NEGD(reg) */
	case 102: /* stmt: ARGF(reg) */
	case 101: /* stmt: ARGD(reg) */
	case 98: /* reg: INDIRF(addr) */
	case 97: /* reg: INDIRD(addr) */
	case 94: /* stmt: ARGP(reg) */
	case 93: /* stmt: ARGI(reg) */
	case 82: /* reg: CVUC(reg) */
	case 81: /* reg: CVIC(reg) */
	case 80: /* reg: CVCU(reg) */
	case 79: /* reg: CVCI(reg) */
	case 78: /* reg: CVUS(reg) */
	case 77: /* reg: CVIS(reg) */
	case 76: /* reg: CVSU(reg) */
	case 75: /* reg: CVSI(reg) */
	case 74: /* reg: CVUP(reg) */
	case 73: /* reg: CVUI(reg) */
	case 72: /* reg: CVPU(reg) */
	case 71: /* reg: CVIU(reg) */
	case 58: /* reg: NEGI(reg) */
	case 57: /* reg: BCOMU(reg) */
	case 47: /* reg: LOADU(reg) */
	case 46: /* reg: LOADS(reg) */
	case 45: /* reg: LOADP(reg) */
	case 44: /* reg: LOADI(reg) */
	case 43: /* reg: LOADC(reg) */
	case 40: /* reg: INDIRS(stk) */
	case 39: /* reg: INDIRP(stk) */
	case 38: /* reg: INDIRI(stk) */
	case 37: /* reg: INDIRC(stk) */
	case 36: /* reg: INDIRS(addr) */
	case 35: /* reg: INDIRP(addr) */
	case 34: /* reg: INDIRI(addr) */
	case 33: /* reg: INDIRC(addr) */
	case 22: /* reg: CVUP(reg) */
	case 21: /* reg: CVUI(reg) */
	case 20: /* reg: CVPU(reg) */
	case 19: /* reg: CVIU(reg) */
		kids[0] = LEFT_CHILD(p);
		break;
	case 142: /* stmt: NEF(reg,reg) */
	case 141: /* stmt: LTF(reg,reg) */
	case 140: /* stmt: LEF(reg,reg) */
	case 139: /* stmt: GTF(reg,reg) */
	case 138: /* stmt: GEF(reg,reg) */
	case 137: /* stmt: EQF(reg,reg) */
	case 136: /* stmt: NED(reg,reg) */
	case 135: /* stmt: LTD(reg,reg) */
	case 134: /* stmt: LED(reg,reg) */
	case 133: /* stmt: GTD(reg,reg) */
	case 132: /* stmt: GED(reg,reg) */
	case 131: /* stmt: EQD(reg,reg) */
	case 130: /* stmt: LTU(reg,rc) */
	case 129: /* stmt: LEU(reg,rc) */
	case 128: /* stmt: GTU(reg,rc) */
	case 127: /* stmt: GEU(reg,rc) */
	case 126: /* stmt: NEI(reg,rc) */
	case 125: /* stmt: LTI(reg,rc) */
	case 124: /* stmt: LEI(reg,rc) */
	case 123: /* stmt: GTI(reg,rc) */
	case 122: /* stmt: GEI(reg,rc) */
	case 121: /* stmt: EQI(reg,rc) */
	case 112: /* reg: SUBF(reg,flt) */
	case 111: /* reg: SUBD(reg,flt) */
	case 110: /* reg: MULF(reg,flt) */
	case 109: /* reg: MULD(reg,flt) */
	case 108: /* reg: DIVF(reg,flt) */
	case 107: /* reg: DIVD(reg,flt) */
	case 106: /* reg: ADDF(reg,flt) */
	case 105: /* reg: ADDD(reg,flt) */
	case 100: /* stmt: ASGNF(addr,reg) */
	case 99: /* stmt: ASGND(addr,reg) */
	case 92: /* stmt: ASGNS(stk,rc5) */
	case 91: /* stmt: ASGNP(stk,rc5) */
	case 90: /* stmt: ASGNI(stk,rc5) */
	case 89: /* stmt: ASGNC(stk,rc5) */
	case 88: /* stmt: ASGNS(addr,rc) */
	case 87: /* stmt: ASGNP(addr,rc) */
	case 86: /* stmt: ASGNI(addr,rc) */
	case 85: /* stmt: ASGNC(addr,rc) */
	case 70: /* reg: MODU(reg,reg) */
	case 69: /* reg: MODI(reg,reg) */
	case 68: /* reg: DIVU(reg,reg) */
	case 67: /* reg: DIVI(reg,reg) */
	case 66: /* reg: MULU(reg,reg) */
	case 65: /* reg: MULI(reg,reg) */
	case 64: /* reg: RSHU(reg,rc8) */
	case 63: /* reg: RSHI(reg,rc8) */
	case 62: /* reg: LSHU(reg,rc8) */
	case 61: /* reg: LSHI(reg,rc8) */
	case 56: /* reg: BXORU(reg,rc) */
	case 55: /* reg: BORU(reg,rc) */
	case 54: /* reg: BANDU(reg,rc) */
	case 53: /* reg: SUBU(reg,rc) */
	case 52: /* reg: SUBP(reg,rc) */
	case 51: /* reg: SUBI(reg,rc) */
	case 50: /* reg: ADDU(reg,rc) */
	case 49: /* reg: ADDP(reg,rc) */
	case 48: /* reg: ADDI(reg,rc) */
		kids[0] = LEFT_CHILD(p);
		kids[1] = RIGHT_CHILD(p);
		break;
	case 95: /* stmt: ASGNB(reg,INDIRB(reg)) */
		kids[0] = LEFT_CHILD(p);
		kids[1] = LEFT_CHILD(RIGHT_CHILD(p));
		break;
	case 96: /* stmt: ARGB(INDIRB(reg)) */
		kids[0] = LEFT_CHILD(LEFT_CHILD(p));
		break;
	default:
		fatal("_kids", "Bad rule number %d\n", eruleno);
	}
}


static void progbeg(int argc, char *argv[]){
	int i;
	extern unsigned (*emitter) ARGS((Node, int));

	{
		union {
			char c;
			int i;
		} u;
		u.i = 0;
		u.c = 1;
		swap = (u.i == 1) != IR->little_endian;
	}
	parseflags(argc, argv);

	intreg[BC] = mkreg("BC", BC, 1, IREG);
	intreg[DE] = mkreg("DE", DE, 1, IREG);
	intreg[HL] = mkreg("HL", HL, 1, IREG);

	charreg[BC]	 = mkreg("C", BC, 1, IREG);
	charreg[DE]	 = mkreg("E", DE, 1, IREG);
	charreg[HL]	 = mkreg("L", HL, 1, IREG);

	for(i = 0; i < 8; i++)
		fltreg[i] = mkreg("%d", i, 0, FREG);

	rmap[C] = mkwildcard(charreg);
	rmap[S] = rmap[P] = rmap[B] = rmap[U] = rmap[I] = mkwildcard(intreg);
	rmap[F] = rmap[D] = mkwildcard(fltreg);
	tmask[IREG] = (1<<BC) | (1<<DE) | (1<<HL);
	vmask[IREG] = 0;
	tmask[FREG] = 0xFF;
	vmask[FREG] = 0;
	print("\t; File generated by lcc\n");
	print("\n");
	print("\t.globl\t.mul, .div, .mod, .mulu, .divu, .modu\n");
	print("\t.globl\t.lsl, .lsr, .asl, .asr\n");
	print("\n");
	cseg = 0;
	argstack = 0;
}

static void segment(n) int n; {
	if(n == cseg)
		return;
	if(cseg == CODE)
		print("\t; _CODE ends\n");
	else if(cseg == LIT)
		print("\t; _LIT ends\n");
	else if(cseg == DATA)
		print("\t; _DATA ends\n");
	else if(cseg == BSS)
		print("\t; _BSS ends\n");
	cseg = n;
	if(cseg == CODE)
		print("\t.area\t_CODE\n");
	else if(cseg == LIT)
		print("\t.area\t_LIT\n");
	else if(cseg == DATA)
		print("\t.area\t_DATA\n");
	else if(cseg == BSS)
		print("\t.area\t_BSS\n");
}

static void progend() {
	segment(0);
	print("\t; End of program\n");
}

#define HARDWARE_REG_STR "__reg_"
#define HARDWARE_REG_LEN 6
#define HARDWARE_REG(addr) (!strncmp(addr, HARDWARE_REG_STR, HARDWARE_REG_LEN))

#define REG(p)  (getregnum(p))
#define LEFT_CHILD_REG(p)  (REG(LEFT_CHILD(p)))
#define RIGHT_CHILD_REG(p)  (REG(RIGHT_CHILD(p)))
#define LEFT_X_CHILD_REG(p)  (REG(LEFT_X_CHILD(p)))
#define RIGHT_X_CHILD_REG(p)  (REG(RIGHT_X_CHILD(p)))

#define RIGHT_REG(p) \
	(p->kids[1]->x.registered ? RIGHT_CHILD_REG(p) : \
	(p->x.kids[1] ? RIGHT_X_CHILD_REG(p) : LEFT_X_CHILD_REG(p)))
#define RIGHT_CONST(p) \
	(!p->kids[1]->x.registered \
	&& (generic(p->kids[1]->op) == CNST \
	|| (generic(p->kids[1]->op) == INDIR \
	&& p->kids[1]->kids[0]->op == VREG+P \
	&& p->kids[1]->syms[RX]->u.t.cse \
	&& generic(p->kids[1]->syms[RX]->u.t.cse->op) == CNST)))
#define RIGHT_ADDRGP(p) \
	(!p->kids[1]->x.registered \
	&& (p->kids[1]->op == ADDRGP \
	|| (generic(p->kids[1]->op) == INDIR \
	&& p->kids[1]->kids[0]->op == VREG+P \
	&& p->kids[1]->syms[RX]->u.t.cse \
	&& p->kids[1]->syms[RX]->u.t.cse->op == ADDRGP)))
#define RIGHT_VAL(p) \
	((generic(p->kids[1]->op) == CNST \
	|| p->kids[1]->op == ADDRGP) ? \
	p->kids[1]->syms[0]->x.name : \
	p->kids[1]->syms[RX]->u.t.cse->syms[0]->x.name);
#define LEFT_CONST(p) \
	(!p->kids[0]->x.registered \
	&& (generic(p->kids[0]->op) == CNST \
	|| (generic(p->kids[0]->op) == INDIR \
	&& p->kids[0]->kids[0]->op == VREG+P \
	&& p->kids[0]->syms[RX]->u.t.cse \
	&& generic(p->kids[0]->syms[RX]->u.t.cse->op) == CNST)))
#define LEFT_ADDRGP(p) \
	(!p->kids[0]->x.registered \
	&& (p->kids[0]->op == ADDRGP \
	|| (generic(p->kids[0]->op) == INDIR \
	&& p->kids[0]->kids[0]->op == VREG+P \
	&& p->kids[0]->syms[RX]->u.t.cse \
	&& p->kids[0]->syms[RX]->u.t.cse->op == ADDRGP)))
#define LEFT_VAL(p) \
	((generic(p->kids[0]->op) == CNST \
	|| p->kids[0]->op == ADDRGP) ? \
	p->kids[0]->syms[0]->x.name : \
	p->kids[0]->syms[RX]->u.t.cse->syms[0]->x.name);

static void target(p) Node p; {
	assert(p);
	switch (p->op) {

		case CALLI: case CALLV:
			setreg(p, intreg[HL]);
			break;
		case RETI:
			/* Return value in HL */
			rtarget(p, 0, intreg[HL]);
			break;
		case JUMPV:
			if(!LEFT_CONST(p))
				rtarget(p, 0, intreg[HL]);
			break;
		case MULI:
		case MULU:
			setreg(p, intreg[HL]);
			rtarget(p, 0, intreg[DE]);
			rtarget(p, 1, intreg[HL]);
			break;
		case DIVI:
		case DIVU:
			setreg(p, intreg[DE]);
			rtarget(p, 0, intreg[DE]);
			rtarget(p, 1, intreg[BC]);
			break;
		case MODI:
		case MODU:
			setreg(p, intreg[BC]);
			rtarget(p, 0, intreg[DE]);
			rtarget(p, 1, intreg[BC]);
			break;
		case LSHI: case RSHI:
		case LSHU: case RSHU:
			if(!RIGHT_CONST(p)) {
				setreg(p, intreg[HL]);
				rtarget(p, 0, intreg[HL]);
				rtarget(p, 1, intreg[DE]);
			}
			break;
	}
}

static void clobber(p) Node p; {
	static int nstack = 0;

	assert(p);

	nstack = ckstack(p, nstack);
	assert(p->count > 0 || nstack == 0);

	switch (p->op) {
	}
}

static void emit2(p) Node p; {
/*
	switch(p->op) {
		default: {
			int i, j;

			print("%s\n", opname(p->op));
			print("#%d %s (%x)\n", p->x.inst, opname(p->op), (char *)p);
			for(i = 0; i < NELEMS(p->kids) && p->kids[i]; i++) {
				print(" kids[%d]: #%d %s (%x)\n", i, p->kids[i]->x.inst, opname(p->kids[i]->op), (char *)p->kids[i]);
				for(j = 0; j < 3; j++) {
					if(p->kids[i]->syms[j] && p->kids[i]->syms[j]->x.name)
						print("  syms[%d]: %s\n", j, p->kids[i]->syms[j]->x.name);
				}
			}
			for(i = 0; i < NELEMS(p->x.kids) && p->x.kids[i]; i++) {
				print(" x.kids[%d]: #%d %s (%x)\n", i, p->x.kids[i]->x.inst, opname(p->x.kids[i]->op), (char *)p->x.kids[i]);
				for(j = 0; j < 3; j++) {
					if(p->x.kids[i]->syms[j] && p->x.kids[i]->syms[j]->x.name)
						print("  syms[%d]: %s\n", j, p->x.kids[i]->syms[j]->x.name);
				}
			}
			for(i = 0; i < 3; i++) {
				if(p->syms[i] && p->syms[i]->x.name)
					print(" syms[%d]: %s\n", i, p->syms[i]->x.name);
			}
			print("\n", opname(p->op));
			outflush();
			break;
		}
	}
*/
	switch(p->op) {
		case INDIRC:
		if(p->kids[0]->op == VREG+P)
			break;
		{
			int dreg = REG(p);
			char *dst;

			if(p->kids[0]->op == ADDRFP || p->kids[0]->op == ADDRLP) {
				int offset = atoi(p->kids[0]->syms[0]->x.name);

				dst = lreg[dreg];
				print("\n\t; Load %s\n", dst);

				if(dreg != HL)
					print("\tPUSH\t%s\n", "HL");
				offsethl(offset + framesize + argstack + (dreg != HL ? 2 : 0));
				print("\tLD\t%s,(%s)\n", "A", "HL");
				if(dreg != HL)
					print("\tPOP\t%s\n", "HL");
				print("\tLD\t%s,%s\n", dst, "A");
			} else if(LEFT_CONST(p) || LEFT_ADDRGP(p)) {
				char *addr = LEFT_VAL(p);

				dst = lreg[dreg];
				print("\n\t; Load %s\n", dst);

				if(HARDWARE_REG(addr))
					print("\tLDH\t%s,(%s)\n", "A", addr + HARDWARE_REG_LEN);
				else
					print("\tLD\t%s,(%s)\n", "A", addr);
				print("\tLD\t%s,%s\n", dst, "A");
			} else {
				int sreg = LEFT_X_CHILD_REG(p);
				char *src = intreg[sreg]->x.name;

				dst = lreg[dreg];
				print("\n\t; Load %s\n", dst);

				if(sreg == HL) {
					print("\tLD\t%s,(%s)\n", dst, src);
				} else {
					print("\tLD\t%s,(%s)\n", "A", src);
					print("\tLD\t%s,%s\n", dst, "A");
				}
			}
			print("\n");
			break;
		}
		case INDIRS:
		case INDIRI:
		case INDIRP:
		if(p->kids[0]->op == VREG+P)
			break;
		{
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;

			print("\n\t; Load register %s\n", dst);
			if(p->kids[0]->op == ADDRFP || p->kids[0]->op == ADDRLP) {
				int offset = atoi(p->kids[0]->syms[0]->x.name) + framesize;

				if(dreg != HL) {
					print("\tPUSH\t%s\n", "HL");
					offsethl(offset + argstack + 2);
					print("\tLD\t%s,(HL)\n", lreg[dreg]);
					print("\tINC\t%s\n", "HL");
					print("\tLD\t%s,(HL)\n", hreg[dreg]);
					print("\tPOP\t%s\n", "HL");
				} else {
					offsethl(offset + argstack);
					print("\tLD\t%s,(HL+)\n", "A");
					print("\tLD\t%s,(HL)\n", hreg[dreg]);
					print("\tLD\t%s,%s\n", lreg[dreg], "A");
				}
/*
				offsetsp(offset + argstack);
				print("\tPOP\t%s\n", dst);
				offsetsp(-(offset + argstack + 2));
*/
			} else if(LEFT_CONST(p) || LEFT_ADDRGP(p)) {
				char *addr = LEFT_VAL(p);

				print("\n\t; Load %s\n", dst);

				if(HARDWARE_REG(addr))
					print("\tLDH\t%s,(%s+1)\n", "A", addr + HARDWARE_REG_LEN);
				else
					print("\tLD\t%s,(%s+1)\n", "A", addr);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
				if(HARDWARE_REG(addr))
					print("\tLDH\t%s,(%s)\n", "A", addr + HARDWARE_REG_LEN);
				else
					print("\tLD\t%s,(%s)\n", "A", addr);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
			} else {
				int sreg = LEFT_X_CHILD_REG(p);
				char *src = intreg[sreg]->x.name;

				if(sreg == HL) {
					print("\tINC\t%s\n", src);
					if(dreg == sreg)
						print("\tLD\t%s,(%s)\n", "A", src);
					else
						print("\tLD\t%s,(%s)\n", hreg[dreg], src);
					print("\tDEC\t%s\n", src);
					print("\tLD\t%s,(%s)\n", lreg[dreg], src);
					if(dreg == sreg)
						print("\tLD\t%s,%s\n", hreg[dreg], "A");
				} else {
					print("\tINC\t%s\n", src);
					print("\tLD\t%s,(%s)\n", "A", src);
					if(dreg == sreg)
						print("\tPUSH\t%s\n", "AF");
					else
						print("\tLD\t%s,%s\n", hreg[dreg], "A");
					print("\tDEC\t%s\n", src);
					print("\tLD\t%s,(%s)\n", "A", src);
					print("\tLD\t%s,%s\n", lreg[dreg], "A");
					if(dreg == sreg) {
						print("\tPOP\t%s\n", "AF");
						print("\tLD\t%s,%s\n", hreg[dreg], "A");
					}
				}
			}
			print("\n");
			break;
		}
		case ASGNC:
		if(p->kids[0]->op == VREG+P)
			break;
		{
			char *src;

			if(p->kids[0]->op == ADDRFP || p->kids[0]->op == ADDRLP) {
				int offset = atoi(p->kids[0]->syms[0]->x.name);

				if(RIGHT_CONST(p)) {
					char *val = RIGHT_VAL(p);

					print("\n\t; Store %s\n", val);
					print("\tLD\t%s,#%s\n", "A", val);
				} else {
					src = lreg[LEFT_X_CHILD_REG(p)];
					print("\n\t; Store %s\n", src);
					print("\tLD\t%s,%s\n", "A", src);
				}
				print("\tPUSH\t%s\n", "HL");
				offsethl(offset + framesize + argstack + 2);
				print("\tLD\t(%s),%s\n", "HL", "A");
				print("\tPOP\t%s\n", "HL");
			} else if(LEFT_CONST(p) || LEFT_ADDRGP(p)) {
				char *addr = LEFT_VAL(p);

				if(RIGHT_CONST(p)) {
					char *val = RIGHT_VAL(p);

					print("\n\t; Store %s\n", val);
					print("\tLD\t%s,#%s\n", "A", val);
				} else {
					src = lreg[LEFT_X_CHILD_REG(p)];
					print("\n\t; Store %s\n", src);
					print("\tLD\t%s,%s\n", "A", src);
				}
				if(HARDWARE_REG(addr))
					print("\tLDH\t(%s),%s\n", addr + HARDWARE_REG_LEN, "A");
				else
					print("\tLD\t(%s),%s\n", addr, "A");
			} else {
				int dreg = LEFT_X_CHILD_REG(p);
				char *dst = intreg[dreg]->x.name;

				if(RIGHT_CONST(p)) {
					char *val = RIGHT_VAL(p);

					print("\n\t; Store %s\n", val);
					if(dreg == HL)
						print("\tLD\t(%s),#%s\n", dst, val);
					else {
						print("\tLD\t%s,#%s\n", "A", val);
						print("\tLD\t(%s),%s\n", dst, "A");
					}
				} else {
					src = lreg[RIGHT_REG(p)];

					print("\n\t; Store %s\n", src);
					if(dreg == HL)
						print("\tLD\t(%s),%s\n", dst, src);
					else {
						print("\tLD\t%s,%s\n", "A", src);
						print("\tLD\t(%s),%s\n", dst, "A");
					}
				}
			}
			print("\n");
			break;
		}
		case ASGNS:
		case ASGNI:
		case ASGNP:
		if(p->kids[0]->op == VREG+P)
			break;
		{
			char *src;

			if(p->kids[0]->op == ADDRFP || p->kids[0]->op == ADDRLP) {
				int offset = atoi(p->kids[0]->syms[0]->x.name) + framesize;

				if(RIGHT_CONST(p)) {
					char *val = RIGHT_VAL(p);

					print("\n\t; Store %s\n", val);

					print("\tPUSH\t%s\n", "HL");
					offsethl(offset + argstack + 2);
					print("\tLD\t(HL),#<%d\n", val);
					print("\tINC\t%s\n", "HL");
					print("\tLD\t(HL),#>%d\n", val);
					print("\tPOP\t%s\n", "HL");
/*
					char *val = RIGHT_VAL(p);

					print("\n\t; Store %s\n", val);
					print("\tPUSH\t%s\n", "BC");
					print("\tLD\t%s,#%s\n", "BC", val);
					offsetsp(offset + argstack + 2 + 2);
					print("\tPUSH\t%s\n", "BC");
					offsetsp(-(offset + argstack + 2));
*/
					print("\tPOP\t%s\n", "BC");
				} else {
					int sreg = RIGHT_REG(p);
					src = intreg[sreg]->x.name;

					print("\n\t; Store %s\n", src);

					if(sreg != HL) {
						print("\tPUSH\t%s\n", "HL");
						offsethl(offset + argstack + 2);
						print("\tLD\t(HL),%s\n", lreg[sreg]);
						print("\tINC\t%s\n", "HL");
						print("\tLD\t(HL),%s\n", hreg[sreg]);
						print("\tPOP\t%s\n", "HL");
					} else {
						print("\tPUSH\t%s\n", "BC");
						print("\tLD\t%s,%s\n", "A", lreg[sreg]);
						print("\tLD\t%s,%s\n", "B", hreg[sreg]);
						offsethl(offset + argstack + 2);
						print("\tLD\t(HL+),%s\n", "A");
						print("\tLD\t(HL),%s\n", "B");
						print("\tLD\t%s,%s\n", lreg[sreg], "A");
						print("\tLD\t%s,%s\n", hreg[sreg], "B");
						print("\tPOP\t%s\n", "BC");
					}
/*
					offsetsp(offset + argstack + 2);
					print("\tPUSH\t%s\n", src);
					offsetsp(-(offset + argstack));
*/
				}
			} else if(LEFT_CONST(p) || LEFT_ADDRGP(p)) {
				char *addr = LEFT_VAL(p);

				if(RIGHT_CONST(p)) {
					char *val = RIGHT_VAL(p);

					print("\n\t; Store %s\n", val);

					print("\tLD\t%s,#>%s\n", "A", val);
					if(HARDWARE_REG(addr))
						print("\tLDH\t(%s+1),%s\n", addr + HARDWARE_REG_LEN, "A");
					else
						print("\tLD\t(%s+1),%s\n", addr, "A");
					print("\tLD\t%s,#<%s\n", "A", val);
					if(HARDWARE_REG(addr))
						print("\tLDH\t(%s),%s\n", addr + HARDWARE_REG_LEN, "A");
					else
						print("\tLD\t(%s),%s\n", addr, "A");
				} else {
					int sreg = RIGHT_REG(p);
					src = intreg[sreg]->x.name;

					print("\n\t; Store %s\n", src);
					print("\tLD\t%s,%s\n", "A", hreg[sreg]);
					if(HARDWARE_REG(addr))
						print("\tLDH\t(%s+1),%s\n", addr + HARDWARE_REG_LEN, "A");
					else
						print("\tLD\t(%s+1),%s\n", addr, "A");
					print("\tLD\t%s,%s\n", "A", lreg[sreg]);
					if(HARDWARE_REG(addr))
						print("\tLDH\t(%s),%s\n", addr + HARDWARE_REG_LEN, "A");
					else
						print("\tLD\t(%s),%s\n", addr, "A");
				}
			} else {
				int dreg = LEFT_X_CHILD_REG(p);
				char *dst = intreg[dreg]->x.name;

				if(RIGHT_CONST(p)) {
					char *val = RIGHT_VAL(p);

					print("\n\t; Store %s\n", val);

					print("\tINC\t%s\n", dst);
					print("\tLD\t%s,#>%s\n", "A", val);
					print("\tLD\t(%s),%s\n", dst, "A");
					print("\tDEC\t%s\n", dst);
					print("\tLD\t%s,#<%s\n", "A", val);
					print("\tLD\t(%s),%s\n", dst, "A");
				} else {
					int sreg = RIGHT_REG(p);

					assert(dreg != sreg);

					print("\n\t; Store %s\n", intreg[sreg]->x.name);
					if(dreg == HL) {
						print("\tINC\t%s\n", dst);
						print("\tLD\t(%s),%s\n", dst, hreg[sreg]);
						print("\tDEC\t%s\n", dst);
						print("\tLD\t(%s),%s\n", dst, lreg[sreg]);
					} else {
						print("\tINC\t%s\n", dst);
						print("\tLD\t%s,%s\n", "A", hreg[sreg]);
						print("\tLD\t(%s),%s\n", dst, "A");
						print("\tDEC\t%s\n", dst);
						print("\tLD\t%s,%s\n", "A", lreg[sreg]);
						print("\tLD\t(%s),%s\n", dst, "A");
					}
				}
			}
			print("\n");
			break;
		}
		case CALLI:
		case CALLV:
		case CALLF:
		case CALLD: {

			int i = atoi(p->syms[0]->x.name);

			print("\tCALL\t%s\n", p->kids[0]->syms[0]->x.name);
			if(i) {
				print("\tLDA\tSP,%d(SP)\n", i);
				argstack -= i;
			}
			break;
		}
		case ASGNB: {
			int sreg = RIGHT_X_CHILD_REG(p);
			char *src = intreg[sreg]->x.name;
			int dreg = LEFT_X_CHILD_REG(p);
			char *dst = intreg[dreg]->x.name;
			int size = p->syms[0]->u.c.v.i;
			int treg;
			char *tmp;

			print("\n\t; Assign structure from %s to %s\n", src, dst);

			if(size > 4) {
				treg = (sreg != BC && dreg != BC ? BC : (sreg != DE && dreg != DE ? DE : HL));
				tmp = intreg[treg]->x.name;

				print("\tPUSH\t%s\n", tmp);
				while(size > 0) {
					int lab = genlabel(1);
					print("\tLD\t%s,#%d\n", lreg[treg], size > 0xFF ? 0x00 : size);
					size -= 0x100;
					print(".L%d:\n", lab);
					print("\tLD\tA,(%s)\n", sreg == HL ? "HL+" : src);
					print("\tLD\t(%s),A\n", dreg == HL ? "HL+" : dst);
					if(sreg != HL)
						print("\tINC\t%s\n", src);
					if(dreg != HL)
						print("\tINC\t%s\n", dst);
					print("\tDEC\t%s\n", lreg[treg]);
					print("\tJR\tNZ,.L%d\n", lab);
				}
				print("\tPOP\t%s\n", tmp);
			} else {
				while(size--) {
					print("\tLD\tA,(%s)\n", sreg == HL ? "HL+" : src);
					print("\tLD\t(%s),A\n", dreg == HL ? "HL+" : dst);
					if(sreg != HL)
						print("\tINC\t%s\n", src);
					if(dreg != HL)
						print("\tINC\t%s\n", dst);
				}
			}
			print("\n");
			break;
		}
		case ARGB: {
			int lab = genlabel(1);
			int sreg = LEFT_X_CHILD_REG(p);
			char *src = intreg[sreg]->x.name;
			int size = p->syms[0]->u.c.v.i;

			argstack += size;

			print("\n\t; Pass structure parameter from %s\n", src);
			if(sreg != HL) {
				int treg = (sreg == BC ? DE : BC);
				char *tmp = intreg[treg]->x.name;

				offsetsp(-size);
				print("\tPUSH\tHL\n");
				print("\tPUSH\t%s\n", tmp);
				print("\tLDA\tHL,4(SP)\n");
				while(size > 0) {
					int lab = genlabel(1);
					print("\tLD\t%s,#%d\n", lreg[treg], size > 0xFF ? 0x00 : size);
					size -= 0x100;
					print(".L%d:\n", lab);
					print("\tLD\tA,(%s)\n", src);
					print("\tLD\t(HL+),A\n");
					print("\tINC\t%s\n", src);
					print("\tDEC\t%s\n", lreg[treg]);
					print("\tJR\tNZ,.L%d\n", lab);
				}
				print("\tPOP\t%s\n", tmp);
				print("\tPOP\tHL\n");
			} else {
				offsetsp(-size);
				print("\tPUSH\tBC\n");
				print("\tPUSH\tDE\n");
				print("\tLD\tB,H\n");
				print("\tLD\tC,L\n");
				print("\tLDA\tHL,4(SP)\n");
				while(size > 0) {
					int lab = genlabel(1);
					print("\tLD\t%s,#%d\n", "E", size > 0xFF ? 0x00 : size);
					size -= 0x100;
					print(".L%d:\n", lab);
					print("\tLD\tA,(%s)\n", "BC");
					print("\tLD\t(HL+),A\n");
					print("\tINC\t%s\n", "BC");
					print("\tDEC\t%s\n", "E");
					print("\tJR\tNZ,.L%d\n", lab);
				}
				print("\tPOP\tDE\n");
				print("\tPOP\tBC\n");
			}
			print("\n");
			break;
		}
		case ARGI:
		case ARGP: {
			int sreg = LEFT_X_CHILD_REG(p);
			char *src = intreg[sreg]->x.name;

			argstack += 2;

			print("\n\t; Integer (or pointer) argument\n");
			print("\tPUSH\t%s\n", src);
			break;
		}
		case CVCU: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			print("\n\t; Convert char to unsigned\n");
			print("\tLD\t%s,#0\n", hreg[dreg]);
			if(dreg != sreg)
				print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg]);
			print("\n");
			break;
		}
		case CVCI: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			print("\n\t; Convert char to int\n");
			print("\tLD\tA,%s\n", lreg[sreg]);
			if(dreg != sreg)
				print("\tLD\t%s,A\n", lreg[dreg]);
			print("\tRLCA\n");
			print("\tSBC\tA\n");
			print("\tLD\t%s,A\n", hreg[dreg]);
			print("\n");
			break;
		}
		case CVIC:
		case CVUC: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			if(dreg != sreg)
				print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg]);
			break;
		}
		case CVIU:
		case CVPU:
		case CVUI:
		case CVUP:
		case CVIS:
		case CVUS:
		case CVSI:
		case CVSU:

		case LOADI:
		case LOADP:
		case LOADS:
		case LOADU: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			if(dreg != sreg) {
				print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg]);
				print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg]);
			}
			break;
		}
		case ADDRFP:
		case ADDRLP: {
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;
			int offset = atoi(p->syms[0]->x.name);

			print("\n\t; Load local address into %s\n", dst);
			if(dreg == HL)
				offsethl(offset + framesize + argstack);
			else {
				print("\tPUSH\t%s\n", "HL");
				offsethl(offset + framesize + argstack + 2);
				print("\tLD\t%s,%s\n", hreg[dreg], "H");
				print("\tLD\t%s,%s\n", lreg[dreg], "L");
				print("\tPOP\t%s\n", "HL");
			}
			print("\n");
			break;
		}
		case ADDI: case ADDP: case ADDU: {
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;
			int sreg1 = LEFT_X_CHILD_REG(p);
			char *src1 = intreg[sreg1]->x.name;

			if(RIGHT_CONST(p)) {
				int n;
				char *val = RIGHT_VAL(p);

				print("\n\t; Add %s to %s into %s\n", val, src1, dst);

				n = atoi(val);
				if(n == 1) {
					if(sreg1 != dreg) {
						print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg1]);
						print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg1]);
					}
					print("\tINC\t%s\n", dst);
				} else if(n == -1) {
					if(sreg1 != dreg) {
						print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg1]);
						print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg1]);
					}
					print("\tDEC\t%s\n", dst);
				} else {
					print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
					print("\tADD\t#<%s\n", val);
					print("\tLD\t%s,%s\n", lreg[dreg], "A");
					print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
					print("\tADC\t#>%s\n", val);
					print("\tLD\t%s,%s\n", hreg[dreg], "A");
				}
			} else {
				int sreg2 = RIGHT_REG(p);
				char *src2 = intreg[sreg2]->x.name;
				
				print("\n\t; Add %s to %s into %s\n", src2, src1, dst);

				if(dreg == HL) {
					if(sreg1 == dreg)
						print("\tADD\t%s,%s\n", dst, src2);
					else if(sreg2 == dreg)
						print("\tADD\t%s,%s\n", dst, src1);
					else {
						print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg1]);
						print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg1]);
						print("\tADD\t%s,%s\n", dst, src2);
					}
				} else {
					print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
					print("\tADD\t%s\n", lreg[sreg2]);
					print("\tLD\t%s,%s\n", lreg[dreg], "A");
					print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
					print("\tADC\t%s\n", hreg[sreg2]);
					print("\tLD\t%s,%s\n", hreg[dreg], "A");
				}
			}
			print("\n");
			break;
		}
		case SUBI: case SUBP: case SUBU: {
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;
			int sreg1 = LEFT_X_CHILD_REG(p);
			char *src1 = intreg[sreg1]->x.name;

			if(RIGHT_CONST(p)) {
				int n;
				char *val = RIGHT_VAL(p);

				print("\n\t; Substract %s from %s into %s\n", val, src1, dst);

				n = atoi(val);
				if(n == 1) {
					if(sreg1 != dreg) {
						print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg1]);
						print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg1]);
					}
					print("\tDEC\t%s\n", dst);
				} else if(n == -1) {
					if(sreg1 != dreg) {
						print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg1]);
						print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg1]);
					}
					print("\tINC\t%s\n", dst);
				} else {
					print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
					print("\tSUB\t#<%s\n", val);
					print("\tLD\t%s,%s\n", lreg[dreg], "A");
					print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
					print("\tSBC\t#>%s\n", val);
					print("\tLD\t%s,%s\n", hreg[dreg], "A");
				}
			} else {
				int sreg2 = RIGHT_REG(p);
				char *src2 = intreg[sreg2]->x.name;
				
				print("\n\t; Substract %s from %s into %s\n", src2, src1, dst);

				print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
				print("\tSUB\t%s\n", lreg[sreg2]);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
				print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
				print("\tSBC\t%s\n", hreg[sreg2]);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
			}
			print("\n");
			break;
		}
		case BANDU: {
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;
			int sreg1 = LEFT_X_CHILD_REG(p);
			char *src1 = intreg[sreg1]->x.name;

			if(RIGHT_CONST(p)) {
				char *val = RIGHT_VAL(p);

				print("\n\t; And %s and %s into %s\n", src1, val, dst);

				print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
				print("\tAND\t#<%s\n", val);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
				print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
				print("\tAND\t#>%s\n", val);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
			} else {
				int sreg2 = RIGHT_REG(p);
				char *src2 = intreg[sreg2]->x.name;
				
				print("\n\t; And %s and %s into %s\n", src1, src2, dst);

				print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
				print("\tAND\t%s\n", lreg[sreg2]);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
				print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
				print("\tAND\t%s\n", hreg[sreg2]);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
			}
			print("\n");
			break;
		}
		case BORU: {
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;
			int sreg1 = LEFT_X_CHILD_REG(p);
			char *src1 = intreg[sreg1]->x.name;

			if(RIGHT_CONST(p)) {
				char *val = RIGHT_VAL(p);

				print("\n\t; Or %s and %s into %s\n", src1, val, dst);

				print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
				print("\tOR\t#<%s\n", val);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
				print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
				print("\tOR\t#>%s\n", val);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
			} else {
				int sreg2 = RIGHT_REG(p);
				char *src2 = intreg[sreg2]->x.name;
				
				print("\n\t; Or %s and %s into %s\n", src1, src2, dst);

				print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
				print("\tOR\t%s\n", lreg[sreg2]);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
				print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
				print("\tOR\t%s\n", hreg[sreg2]);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
			}
			print("\n");
			break;
		}
		case BXORU: {
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;
			int sreg1 = LEFT_X_CHILD_REG(p);
			char *src1 = intreg[sreg1]->x.name;

			if(RIGHT_CONST(p)) {
				char *val = RIGHT_VAL(p);

				print("\n\t; Xor %s and %s into %s\n", src1, val, dst);

				print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
				print("\tXOR\t#<%s\n", val);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
				print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
				print("\tXOR\t#>%s\n", val);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
			} else {
				int sreg2 = RIGHT_REG(p);
				char *src2 = intreg[sreg2]->x.name;
				
				print("\n\t; Xor %s and %s into %s\n", src1, src2, dst);

				print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
				print("\tXOR\t%s\n", lreg[sreg2]);
				print("\tLD\t%s,%s\n", lreg[dreg], "A");
				print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
				print("\tXOR\t%s\n", hreg[sreg2]);
				print("\tLD\t%s,%s\n", hreg[dreg], "A");
			}
			print("\n");
			break;
		}
		case BCOMU: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			print("\n\t; Complement %s into %s\n", intreg[sreg]->x.name,
				 intreg[dreg]->x.name);
			print("\tLD\t%s,%s\n", "A", lreg[sreg]);
			print("\tCPL\n");
			print("\tLD\t%s,%s\n", lreg[dreg], "A");
			print("\tLD\t%s,%s\n", "A", hreg[sreg]);
			print("\tCPL\n");
			print("\tLD\t%s,%s\n", hreg[dreg], "A");
			print("\n");
			break;
		}
		case NEGI: {
			int dreg = REG(p);
			char *dst = intreg[dreg]->x.name;
			int sreg = LEFT_X_CHILD_REG(p);

			print("\n\t; Negate %s into %s\n", intreg[sreg]->x.name,
				 intreg[dreg]->x.name);
			print("\tLD\t%s,%s\n", "A", lreg[sreg]);
			print("\tCPL\n");
			print("\tLD\t%s,%s\n", lreg[dreg], "A");
			print("\tLD\t%s,%s\n", "A", hreg[sreg]);
			print("\tCPL\n");
			print("\tLD\t%s,%s\n", hreg[dreg], "A");
			print("\tINC\t%s\n", dst);
			print("\n");
			break;
		}
		case EQI: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare EQ %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare EQ %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
			if(cnst)
				print("\tCP\t#<%s\n", val);
			else
				print("\tCP\t%s\n", lreg[sreg2]);
			print("\tJR\tNZ,.L%d\n", lab);
			print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
			if(cnst)
				print("\tCP\t#>%s\n", val);
			else
				print("\tCP\t%s\n", hreg[sreg2]);
			print("\tJP\tZ,%s\n", jmp);
			print(".L%d:\n", lab);
			print("\n");
			break;
		}
		case GEI: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			char *src1 = intreg[sreg1]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare GEI %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare GEI %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			print("\tPUSH\t%s\n", src1);
			if(cnst)
				print("\tLD\t%s,#<%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", lreg[sreg2]);
			print("\tSUB\t%s\n", lreg[sreg1]);
			print("\tLD\t%s,%s\n", lreg[sreg1], "A");
			if(cnst)
				print("\tLD\t%s,#>%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", hreg[sreg2]);
			print("\tSBC\t%s\n", hreg[sreg1]);
			print("\tCP\t#0x80\n");
			print("\tJR\tC,.L%d\n", lab);
			print("\tPOP\t%s\n", src1);
			print("\tJP\t%s\n", jmp);
			print(".L%d:\n", lab);
			print("\tOR\t%s\n", lreg[sreg1]);
			print("\tPOP\t%s\n", src1);
			print("\tJP\tZ,%s\n", jmp);
			print("\n");
			break;
		}
		case LEI: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			char *src1 = intreg[sreg1]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare LEI %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare LEI %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			print("\tPUSH\t%s\n", src1);
			print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
			if(cnst)
				print("\tSUB\t#<%s\n", val);
			else
				print("\tSUB\t%s\n", lreg[sreg2]);
			print("\tLD\t%s,%s\n", lreg[sreg1], "A");
			print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
			if(cnst)
				print("\tSBC\t#>%s\n", val);
			else
				print("\tSBC\t%s\n", hreg[sreg2]);
			print("\tCP\t#0x80\n");
			print("\tJR\tC,.L%d\n", lab);
			print("\tPOP\t%s\n", src1);
			print("\tJP\t%s\n", jmp);
			print(".L%d:\n", lab);
			print("\tOR\t%s\n", lreg[sreg1]);
			print("\tPOP\t%s\n", src1);
			print("\tJP\tZ,%s\n", jmp);
			print("\n");
			break;
		}
		case GTI: {
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare GTI %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare GTI %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			if(cnst)
				print("\tLD\t%s,#<%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", lreg[sreg2]);
			print("\tSUB\t%s\n", lreg[sreg1]);
			if(cnst)
				print("\tLD\t%s,#>%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", hreg[sreg2]);
			print("\tSBC\t%s\n", hreg[sreg1]);
			print("\tCP\t#0x80\n");
			print("\tJP\tNC,%s\n", jmp);
			print("\n");
			break;
		}
		case LTI: {
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare LTI %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare LTI %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
			if(cnst)
				print("\tSUB\t#<%s\n", val);
			else
				print("\tSUB\t%s\n", lreg[sreg2]);
			print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
			if(cnst)
				print("\tSBC\t#>%s\n", val);
			else
				print("\tSBC\t%s\n", hreg[sreg2]);
			print("\tCP\t#0x80\n");
			print("\tJP\tNC,%s\n", jmp);
			print("\n");
			break;
		}
		case NEI: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare NEI %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare NEI %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
			if(cnst)
				print("\tCP\t#<%s\n", val);
			else
				print("\tCP\t%s\n", lreg[sreg2]);
			print("\tJP\tNZ,%s\n", jmp);
			print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
			if(cnst)
				print("\tCP\t#>%s\n", val);
			else
				print("\tCP\t%s\n", hreg[sreg2]);
			print("\tJP\tNZ,%s\n", jmp);
			print(".L%d:\n", lab);
			print("\n");
			break;
		}
		case GEU: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare GEU %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare GEU %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
			if(cnst)
				print("\tCP\t#>%s\n", val);
			else
				print("\tCP\t%s\n", hreg[sreg2]);
			print("\tJR\tNZ,.L%d\n", lab);
			print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
			if(cnst)
				print("\tCP\t#<%s\n", val);
			else
				print("\tCP\t%s\n", lreg[sreg2]);
			print(".L%d:\n", lab);
			print("\tJP\tNC,%s\n", jmp);
			print("\n");
			break;
		}
		case LEU: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare LEU %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare LEU %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			if(cnst)
				print("\tLD\t%s,#>%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", hreg[sreg2]);
			print("\tCP\t%s\n", hreg[sreg1]);
			print("\tJR\tNZ,.L%d\n", lab);
			if(cnst)
				print("\tLD\t%s,#<%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", lreg[sreg2]);
			print("\tCP\t%s\n", lreg[sreg1]);
			print(".L%d:\n", lab);
			print("\tJP\tNC,%s\n", jmp);
			print("\n");
			break;
		}
		case GTU: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare GTU %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare GTU %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			if(cnst)
				print("\tLD\t%s,#>%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", hreg[sreg2]);
			print("\tCP\t%s\n", hreg[sreg1]);
			print("\tJR\tNZ,.L%d\n", lab);
			if(cnst)
				print("\tLD\t%s,#<%s\n", "A", val);
			else
				print("\tLD\t%s,%s\n", "A", lreg[sreg2]);
			print("\tCP\t%s\n", lreg[sreg1]);
			print(".L%d:\n", lab);
			print("\tJP\tC,%s\n", jmp);
			print("\n");
			break;
		}
		case LTU: {
			int lab = genlabel(1);
			int sreg1 = LEFT_X_CHILD_REG(p);
			int sreg2;
			char *val;
			char *jmp = p->syms[0]->x.name;
			int cnst = (RIGHT_CONST(p));

			if(cnst) {
				val = RIGHT_VAL(p);
				print("\n\t; Compare LTU %s and %s\n", intreg[sreg1]->x.name,
					val);
			} else {
				sreg2 = RIGHT_REG(p);
				print("\n\t; Compare LTU %s and %s\n", intreg[sreg1]->x.name,
					intreg[sreg2]->x.name);
			}
			print("\tLD\t%s,%s\n", "A", hreg[sreg1]);
			if(cnst)
				print("\tCP\t#>%s\n", val);
			else
				print("\tCP\t%s\n", hreg[sreg2]);
			print("\tJR\tNZ,.L%d\n", lab);
			print("\tLD\t%s,%s\n", "A", lreg[sreg1]);
			if(cnst)
				print("\tCP\t#<%s\n", val);
			else
				print("\tCP\t%s\n", lreg[sreg2]);
			print(".L%d:\n", lab);
			print("\tJP\tC,%s\n", jmp);
			print("\n");
			break;
		}
		case LSHI: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			assert(p->kids[1]);

			if(!RIGHT_CONST(p)) {
				print("\n\t; Left shift (int) %s by %s into %s\n", intreg[sreg]->x.name,
					intreg[RIGHT_REG(p)]->x.name, intreg[dreg]->x.name);

				print("\tCALL\t.asl\n");
			} else {
				int nb;
				char *val = RIGHT_VAL(p);

				nb = atoi(val);
				print("\n\t; Left shift (int) %s by %d into %s\n", intreg[sreg]->x.name,
					nb, intreg[dreg]->x.name);

				if(dreg != HL)
					print("\tPUSH\t%s\n", "HL");
				if(dreg != HL || sreg != HL) {
					print("\tLD\t%s,%s\n", "H", hreg[sreg]);
					print("\tLD\t%s,%s\n", "L", lreg[sreg]);
				}
				while(nb-- > 0)
					print("\tADD\t%s,%s\n", "HL", "HL");
				if(dreg != HL) {
					print("\tLD\t%s,%s\n", hreg[dreg], "H");
					print("\tLD\t%s,%s\n", lreg[dreg], "L");
					print("\tPOP\t%s\n", "HL");
				}
			}
			print("\n");
			break;
		}
		case RSHI: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			assert(p->kids[1]);

			if(!RIGHT_CONST(p)) {
				print("\n\t; Right shift (int) %s by %s into %s\n", intreg[sreg]->x.name,
					intreg[RIGHT_REG(p)]->x.name, intreg[dreg]->x.name);

				print("\tCALL\t.asr\n");
			} else {
				int nb;
				char *val = RIGHT_VAL(p);

				nb = atoi(val);
				print("\n\t; Right shift (int) %s by %d into %s\n", intreg[sreg]->x.name,
					nb, intreg[dreg]->x.name);

				if(dreg != sreg) {
					print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg]);
					print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg]);
				}
				while(nb-- > 0) {
					print("\tSRA\t%s\n", hreg[dreg]);
					print("\tRR\t%s\n", lreg[dreg]);
				}
			}
			print("\n");
			break;
		}
		case LSHU: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			assert(p->kids[1]);

			if(!RIGHT_CONST(p)) {
				print("\n\t; Left shift (unsigned) %s by %s into %s\n", intreg[sreg]->x.name,
					intreg[RIGHT_REG(p)]->x.name, intreg[dreg]->x.name);

				print("\tCALL\t.lsl\n");
			} else {
				int nb;
				char *val = RIGHT_VAL(p);

				nb = atoi(val);
				print("\n\t; Left shift (unsigned) %s by %d into %s\n", intreg[sreg]->x.name,
					nb, intreg[dreg]->x.name);

				if(dreg != HL)
					print("\tPUSH\t%s\n", "HL");
				if(dreg != HL || sreg != HL) {
					print("\tLD\t%s,%s\n", "H", hreg[sreg]);
					print("\tLD\t%s,%s\n", "L", lreg[sreg]);
				}
				while(nb-- > 0)
					print("\tADD\t%s,%s\n", "HL", "HL");
				if(dreg != HL) {
					print("\tLD\t%s,%s\n", hreg[dreg], "H");
					print("\tLD\t%s,%s\n", lreg[dreg], "L");
					print("\tPOP\t%s\n", "HL");
				}
			}
			print("\n");
			break;
		}
		case RSHU: {
			int dreg = REG(p);
			int sreg = LEFT_X_CHILD_REG(p);

			assert(p->kids[1]);

			if(!RIGHT_CONST(p)) {
				print("\n\t; Right shift (unsigned) %s by %s into %s\n", intreg[sreg]->x.name,
					intreg[RIGHT_REG(p)]->x.name, intreg[dreg]->x.name);

				print("\tCALL\t.lsr\n");
			} else {
				int nb;
				char *val = RIGHT_VAL(p);

				nb = atoi(val);
				print("\n\t; Right shift (unsigned) %s by %d into %s\n", intreg[sreg]->x.name,
					nb, intreg[dreg]->x.name);

				if(dreg != sreg) {
					print("\tLD\t%s,%s\n", hreg[dreg], hreg[sreg]);
					print("\tLD\t%s,%s\n", lreg[dreg], lreg[sreg]);
				}
				while(nb-- > 0) {
					print("\tSRL\t%s\n", hreg[dreg]);
					print("\tRR\t%s\n", lreg[dreg]);
				}
			}
			print("\n");
			break;
		}
	}
}

static void offsetsp(offset) int offset; {
	while(offset < -0x80) {
		print("\tLDA\tSP,%d(SP)\n", -0x80);
		offset += 0x80;
	}
	while(offset > 0x7F) {
		print("\tLDA\tSP,%d(SP)\n", 0x7F);
		offset -= 0x7F;
	}
	if(offset != 0)
		print("\tLDA\tSP,%d(SP)\n", offset);
}

static void offsethl(offset) int offset; {
	if(offset >= -0x80 && offset <= 0x7F)
		print("\tLDA\tHL,%d(SP)\n", offset);
	else {
		print("\tLDA\t%s,0(SP)\n", "HL");
		print("\tPUSH\t%s\n", "BC");
		print("\tLD\t%s,#%d\n", "BC", offset);
		print("\tADD\t%s,%s\n", "HL", "BC");
		print("\tPOP\t%s\n", "BC");
	}
}

#define isfp(p) (optype((p)->op)==F || optype((p)->op)==D)

static int ckstack(p, n) Node p; int n; {
	int i;

	for(i = 0; i < NELEMS(p->x.kids) && p->x.kids[i]; i++)
		if(isfp(p->x.kids[i]))
			n--;
	if(isfp(p) && p->count > 0)
		n++;
	if(n > 8)
		error("expression too complicated\n");
	debug(fprint(2, "(ckstack(%x)=%d)\n", p, n));
	assert(n >= 0);
	return n;
}

static void doarg(p) Node p; {
	assert(p && p->syms[0]);
	mkactual(2, p->syms[0]->u.c.v.i);
}

static void blkfetch(k, off, reg, tmp)
int k, off, reg, tmp; {}

static void blkstore(k, off, reg, tmp)
int k, off, reg, tmp; {}

static void blkloop(dreg, doff, sreg, soff, size, tmps)
int dreg, doff, sreg, soff, size, tmps[]; {}

static void local(p) Symbol p; {
	if(isfloat(p->type))
		p->sclass = AUTO;
	if(askregvar(p, rmap[ttob(p->type)]) == 0)
		mkauto(p);
}

static void function(f, caller, callee, n)
Symbol f, callee[], caller[]; int n; {
	int i;

	print("%s:\n", f->x.name);
	print("\tPUSH\tBC\n");
	print("\tPUSH\tDE\n");
	usedmask[0] = usedmask[1] = 0;
	freemask[0] = freemask[1] = ~(unsigned)0;
	offset = 4 + 2;
	for(i = 0; callee[i]; i++) {
		Symbol p = callee[i];
		Symbol q = caller[i];
		assert(q);
		p->x.offset = q->x.offset = offset;
		p->x.name = q->x.name = stringf("%d", p->x.offset);
		p->sclass = q->sclass = AUTO;
		offset += q->type->size;
	}
	assert(caller[i] == 0);
	offset = maxoffset = 0;
	gencode(caller, callee);
	framesize = maxoffset;
	if(framesize > 0)
		offsetsp(-framesize);
	emitcode();
	if(framesize > 0)
		offsetsp(framesize);
	print("\tPOP\tDE\n");
	print("\tPOP\tBC\n");
	print("\tRET\n");
}

static void defsymbol(p) Symbol p; {
	if(p->scope >= LOCAL && p->sclass == STATIC)
		p->x.name = stringf("L%d", genlabel(1));
	else if(p->generated)
		p->x.name = stringf("L%s", p->name);
	else if(p->scope == GLOBAL || p->sclass == EXTERN)
		p->x.name = stringf("_%s", p->name);
	else if(p->scope == CONSTANTS
	&& (isint(p->type) || isptr(p->type))
	&& p->name[0] == '0' && p->name[1] == 'x')
		p->x.name = stringf("0x%s", &p->name[2]);
	else
		p->x.name = p->name;
}

static void address(q, p, n) Symbol q, p; int n; {
	if(p->scope == GLOBAL
	|| p->sclass == STATIC || p->sclass == EXTERN)
		q->x.name = stringf("%s%s%d",
			p->x.name, n >= 0 ? "+" : "", n);
	else {
		q->x.offset = p->x.offset + n;
		q->x.name = stringd(q->x.offset);
	}
}

static void defconst(ty, v) int ty; Value v; {
	switch (ty) {
		case C: print("\t.db\t%d\n", v.uc); return;
		case S: print("\t.dw\t%d\n", v.ss); return;
		case I: print("\t.dw\t%d\n", v.i ); return;
		case U: print("\t.dw\t0x%x\n", v.u ); return;
		case P: print("\t.dw\t0x%x\n", v.p ); return;
		case F:
			print("\t.dw\t0x%x\n", *(unsigned *)&v.f);
			return;
		case D: {
			unsigned *p = (unsigned *)&v.d;
			print("\t.dw\t0x%x,0x%x\n", p[swap], p[1 - swap]);
			return;
			}
	}
	assert(0);
}

static void defaddress(p) Symbol p; {
	print("\t.dw\t%s\n", p->x.name);
}

static void defstring(n, str) int n; char *str; {
	char *s;

	for(s = str; s < str + n; s++)
		print("\t.db\t%d\n", (*s)&0377);
}

static void export(p) Symbol p; {
	if(!HARDWARE_REG(p->x.name))
		print("\t.globl\t%s\n", p->x.name);
}

static void import(p) Symbol p; {
	if(p->ref > 0 && !HARDWARE_REG(p->x.name))
		print("\t.globl\t%s\n", p->x.name);
}

static void global(p) Symbol p; {
	print("%s:\n", p->x.name);
	if(p->u.seg == BSS)
		print("\t.blkb\t%d\n", p->type->size);
}

static void space(n) int n; {
	if(cseg != BSS)
		print("\t.blkb\t%d\n", n);
}

Interface z80IR = {
	1, 1, 0,  /* char */
	2, 1, 0,  /* short; all types have align set to 1 */
	2, 1, 0,  /* int */
	4, 1, 1,  /* float */
	8, 1, 1,  /* double */
	2, 1, 0,  /* T * */
	0, 1, 0,  /* struct; so that ARGB keeps stack aligned */
	1,		  /* little_endian */
	1,		  /* mulops_calls: mul/div/mod are library routines */
	0,		  /* wants_callb */
	1,		  /* wants_argb */
	0,		  /* left_to_right */
	0,		  /* wants_dag */
	address,
	blockbeg,
	blockend,
	defaddress,
	defconst,
	defstring,
	defsymbol,
	emit,
	export,
	function,
	gen,
	global,
	import,
	local,
	progbeg,
	progend,
	segment,
	space,
	0, 0, 0, 0, 0, 0, 0,
	{
		2,		/* max unaligned load is 2 */
		blkfetch, blkstore, blkloop,
		_label,
		_rule,
		_nts,
		_kids,
		_opname,
		_arity,
		_string,
		_templates,
		_isinstruction,
		_ntname,
		emit2,
		doarg,
		target,
		clobber
	}
};