forked from lorenzdev/mpeg-scrambling
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lexer.l
1537 lines (1401 loc) · 28.1 KB
/
lexer.l
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*************************************************************
Copyright (C) 1990, 1991, 1993 Andy C. Hung, all rights reserved.
PUBLIC DOMAIN LICENSE: Stanford University Portable Video Research
Group. If you use this software, you agree to the following: This
program package is purely experimental, and is licensed "as is".
Permission is granted to use, modify, and distribute this program
without charge for any purpose, provided this license/ disclaimer
notice appears in the copies. No warranty or maintenance is given,
either expressed or implied. In no event shall the author(s) be
liable to you or a third party for any special, incidental,
consequential, or other damages, arising out of the use or inability
to use the program for any purpose (or the loss of data), even if we
have been advised of such possibilities. Any public reference or
advertisement of this source code should refer to it as the Portable
Video Research Group (PVRG) code, and not by any author(s) (or
Stanford University) name.
*************************************************************/
%{
/*LABEL lexer.c */
/* Redefine the yywrap so that we don't have
to worry about lex library */
# define yywrap() (1)
static char *ReservedWords[] = {
"ADD",
"SUB",
"MUL",
"DIV",
"NOT",
"AND",
"OR",
"XOR",
"LT",
"LTE",
"EQ",
"GT",
"GTE",
"NEG",
"SQRT",
"ABS",
"FLOOR",
"CEIL",
"ROUND",
"DUP",
"POP",
"EXCH",
"COPY",
"ROLL",
"INDEX",
"CLEAR",
"STO",
"RCL",
"GOTO",
"IFG",
"IFNG",
"EXIT",
"EXE",
"ABORT",
"PRINTSTACK",
"PRINTPROGRAM",
"PRINTIMAGE",
"PRINTFRAME",
"ECHO",
"OPEN",
"CLOSE",
"EQU",
"VAL",
"STREAMNAME",
"COMPONENT",
"PICTURERATE",
"FRAMESKIP",
"QUANTIZATION",
"SEARCHLIMIT",
"NTSC",
"CIF",
"QCIF",
""};
#define R_ADD 1
#define R_SUB 2
#define R_MUL 3
#define R_DIV 4
#define R_NOT 5
#define R_AND 6
#define R_OR 7
#define R_XOR 8
#define R_LT 9
#define R_LTE 10
#define R_EQ 11
#define R_GT 12
#define R_GTE 13
#define R_NEG 14
#define R_SQRT 15
#define R_ABS 16
#define R_FLOOR 17
#define R_CEIL 18
#define R_ROUND 19
#define R_DUP 20
#define R_POP 21
#define R_EXCH 22
#define R_COPY 23
#define R_ROLL 24
#define R_INDEX 25
#define R_CLEAR 26
#define R_STO 27
#define R_RCL 28
#define R_GOTO 29
#define R_IFG 30
#define R_IFNG 31
#define R_EXIT 32
#define R_EXE 33
#define R_ABORT 34
#define R_PRINTSTACK 35
#define R_PRINTPROGRAM 36
#define R_PRINTIMAGE 37
#define R_PRINTFRAME 38
#define R_ECHO 39
#define R_OPEN 40
#define R_CLOSE 41
#define R_EQU 42
#define R_VAL 43
#define R_STREAMNAME 44
#define R_COMPONENT 45
#define R_PICTURERATE 46
#define R_FRAMESKIP 47
#define R_QUANTIZATION 48
#define R_SEARCHLIMIT 49
#define R_NTSC 50
#define R_CIF 51
#define R_QCIF 52
#define R_INTEGER 1000
#define R_LBRACKET 1001
#define R_RBRACKET 1002
#define R_ID 1003
#define R_STRING 1004
#define R_REAL 1005
static char *EquLabels[] = {
"SQUANT",
"MQUANT",
"PTYPE",
"MTYPE",
"BD",
"FDBD",
"BDBD",
"IDBD",
"VAROR",
"FVAR",
"BVAR",
"IVAR",
"DVAR",
"RATE",
"BUFFERSIZE",
"BUFFERCONTENTS",
"QDFACT",
"QOFFS",
""};
#define L_SQUANT 1
#define L_MQUANT 2
#define L_PTYPE 3
#define L_MTYPE 4
#define L_BD 5
#define L_FDBD 6
#define L_BDBD 7
#define L_IDBD 8
#define L_VAROR 9
#define L_FVAR 10
#define L_BVAR 11
#define L_IVAR 12
#define L_DVAR 13
#define L_RATE 14
#define L_BUFFERSIZE 15
#define L_BUFFERCONTENTS 16
#define L_QDFACT 17
#define L_QOFFS 18
int CommentDepth = 0; /* depth of comment nesting */
int yyint=0; /* Return value for integers */
int LexDebug=0; /* Status of lex debugging */
#define PRIME 211
#define EOS '\0'
#define MakeStructure(S) (S *) malloc(sizeof(S))
#define InsertLink(link,list){\
if(!list){list=link;}else{link->next=list;list=link;}}
#define ID struct id
#define LINK struct link_def
ID { /* Default id structure */
char *name;
int tokentype;
int count;
int value;
};
LINK { /* A link for the hash buckets */
ID *lid;
LINK *next;
};
ID *Cid=NULL;
/*PUBLIC*/
extern void initparser();
extern void parser();
extern void Execute();
static int hashpjw();
static LINK * MakeLink();
static ID * enter();
static char * getstr();
static void PrintProgram();
static void MakeProgram();
static void CompileProgram();
static int mylex();
/*PRIVATE*/
/*NOPROTO*/
%}
Delim [ \t\n]
WhiteSpace {Delim}+
Letter [a-zA-Z]
Digit [0-9]
HexDigit ({Digit}|[a-fA-F])
OctalDigit [0-7]
Id {Letter}({Letter}|{Digit})*(:)?
DecInteger [-+]?{Digit}+
HexInteger [-+]?0[xX]{HexDigit}+
OctInteger [-+]?0[oO]{OctalDigit}+
HexInteger2 [-+]?{HexDigit}+[Hh]
OctInteger2 [-+]?{OctalDigit}+[BCObco]
CharInteger [-+]?'([^\\]|\\([\n^\n]|{OctalDigit}{1,3}))'
ScaleFactor [eE][-+]?{Digit}+
Real1 ({Digit}+"."{Digit}*({ScaleFactor})?)
Real2 ({Digit}*"."{Digit}+({ScaleFactor})?)
Real3 ({Digit}+{ScaleFactor})
Real {Real1}|{Real2}|{Real3}
String \"([^\"]|\\\")*\"
%S NORMAL COMMENT
%%
<NORMAL>{WhiteSpace} {}
<NORMAL>{Id} {Cid = enter(0,yytext,yyleng);
if (LexDebug)
{
printf("%s : %s (%d)\n",
yytext,
((Cid->tokentype) ? "RESERVED" : "IDENTIFIER"),
Cid->count);
}
if (Cid->tokentype)
{
return(Cid->tokentype);
}
else
{
yyint = Cid->value;
return(R_ID);
}
}
<NORMAL>{Real} {if (LexDebug)
{
printf("%s : %s\n", yytext, "REAL");
}
return(R_REAL);
}
<NORMAL>{DecInteger} {if (LexDebug)
{
printf("%s : %s\n", yytext, "INTEGER");
}
yyint = atoi(yytext);
return(R_INTEGER);}
<NORMAL>{HexInteger} {if (LexDebug)
{
printf("%s : %s\n", yytext, "(HEX)INTEGER");
}
yyint = strtol(yytext+2,NULL,16);
return(R_INTEGER);}
<NORMAL>{HexInteger2} {if (LexDebug)
{
printf("%s : %s\n", yytext, "(HEX)INTEGER");
}
yyint = strtol(yytext,NULL,16);
return(R_INTEGER);}
<NORMAL>{OctInteger} {if (LexDebug)
{
printf("%s : %s\n", yytext, "(OCT)INTEGER");
}
yyint = strtol(yytext+2,NULL,8);
return(R_INTEGER);}
<NORMAL>{OctInteger2} {if (LexDebug)
{
printf("%s : %s\n", yytext, "(OCT)INTEGER");
}
yyint = strtol(yytext,NULL,8);
return(R_INTEGER);}
<NORMAL>{CharInteger} {if (LexDebug)
{
printf("%s : %s\n", yytext, "(CHAR)INTEGER");
}
if (yyleng>4)
{
yyint = strtol(yytext+2,NULL,8);
}
else
{
if (*(yytext+1)=='\\')
{
switch(*(yytext+2))
{
case '0':
yyint=0;
break;
case 'b':
yyint = 0x8;
break;
case 'i':
yyint = 0x9;
break;
case 'n':
yyint = 0xa;
break;
case 'v':
yyint = 0xb;
break;
case 'f':
yyint = 0xc;
break;
case 'r':
yyint = 0xd;
break;
default:
yyint=(*yytext+2);
break;
}
}
else
{
yyint = *(yytext+1);
}
}
return(R_INTEGER);}
<NORMAL>\[ {if (LexDebug)
{
printf("%s : %s\n", yytext, "LBRACKET");
}
return(R_LBRACKET);}
<NORMAL>\] {if (LexDebug)
{
printf("%s : %s\n", yytext, "RBRACKET");
}
return(R_RBRACKET);}
<NORMAL>{String} {if (LexDebug)
{
printf("%s : %s\n", yytext, "STRING");
}
return(R_STRING);}
<NORMAL,COMMENT>"/*" {CommentDepth++; BEGIN COMMENT;}
<COMMENT>"*/" {CommentDepth--;if(!CommentDepth) BEGIN NORMAL;}
<NORMAL>. {
/* None of the above rules applicable, so
it's a bad symbol. */
printf("Bad input char '%c' on line %d\n",
yytext[0],
yylineno);
}
<COMMENT>.|\n {} /*Everything's AOK */
%%
/*PROTO*/
#define NUMBER_PROGRAMS 10
#define MEMTOP 1024
#define MAXIMUM_LINES 2000
LINK *HashTable[PRIME]; /* My little hash table */
int DataLevel = 0; /* pointer within stack */
double DataStack[MEMTOP]; /* The data stack */
double *DataPtr;
int NextVal=0; /* the number of values to load directly
from the program */
double Memory[MEMTOP];
int LocalLevel=0;
int CommandLevel=0;
double *LocalStack;
int *CommandStack;
int CurrentLine=0;
int CurrentProgram=0;
double ProgramLocalStack[NUMBER_PROGRAMS][MAXIMUM_LINES];
int ProgramCommandStack[NUMBER_PROGRAMS][MAXIMUM_LINES];
int ProgramLevel[NUMBER_PROGRAMS];
int ProgramLocalLevel[NUMBER_PROGRAMS];
int PProgram=0;
int PLevel=0;
int PLLevel=0;
int *PCStack=NULL;
double *PLStack=NULL;
int LabelLevel=0;
ID *LabelStack[1000];
int SourceLevel=0;
int SourceProgramStack[16];
int SourceLineStack[16];
/*START*/
/*BFUNC
initparser() is used to place the Reserved Words into the hash table.
It must be called before the parser command is called.
EFUNC*/
void initparser()
{
char i,**sptr;
BEGIN NORMAL;
for(i=1,sptr=ReservedWords;**sptr!='\0';i++,sptr++)
{ /* Add Reserved Words */
enter(i,*sptr,strlen(*sptr));
}
for(i=1,sptr=EquLabels;**sptr!='\0';i++,sptr++)
{ /* Add defined labels */
equname(i,*sptr);
}
for(i=0;i<NUMBER_PROGRAMS;i++)
{
ProgramLevel[i]=0;
}
DataLevel=0;
DataPtr = DataStack;
}
#undef BEGIN
#undef MakeStructure
#include "globals.h"
#include "stream.h"
#include <math.h>
#define pushdata(val) *(DataPtr++) = (double) (val); DataLevel++;
extern FRAME *CFrame;
extern IMAGE *CImage;
extern int ErrorValue;
extern int Prate;
extern int FrameSkip;
extern int SearchLimit;
extern int ImageType;
extern int InitialQuant;
/*BFUNC
hashpjw() returns a hash value for a string input.
EFUNC*/
static int hashpjw(s)
char *s;
{
BEGIN("hashpjw");
char *p;
unsigned int h=0,g;
for(p=s;*p!=EOS;p++)
{
h = (h << 4) + *p;
if (g = h&0xf0000000)
{
h = h ^(g >> 24);
h = h ^ g;
}
}
return(h % PRIME);
}
/*BFUNC
MakeLink() is used to construct a link object. The link
is used for the hash table construct.
EFUNC*/
static LINK *MakeLink(tokentype,str,len)
int tokentype;
char *str;
int len;
{
BEGIN("MakeLink");
LINK *temp;
if (!(temp = MakeStructure(LINK)))
{
WHEREAMI();
printf("Cannot make a LINK.\n");
exit(ERROR_MEMORY);
}
if (!(temp->lid = MakeStructure(ID)))
{
printf("Cannot make an id.\n");
exit(ERROR_MEMORY);
}
temp->next = NULL;
if (!(temp->lid->name =(char *)calloc(len+1,sizeof(char))))
{
printf("Cannot make a string space for the link.\n");
exit(ERROR_MEMORY);
}
strcpy(temp->lid->name,str);
temp->lid->tokentype = tokentype;
temp->lid->count = 1;
temp->lid->value = -1; /* Unreferenced yet. */
return(temp);
}
/*BFUNC
enter() is used to enter a Reserved Word or ID into the hash table.
EFUNC*/
static ID *enter(tokentype,str,len)
int tokentype;
char *str;
int len;
{
BEGIN("enter");
int hashnum;
LINK *temp,*current;
char *ptr;
for(ptr=str;*ptr!='\0';ptr++)
{
if ((*ptr>='a') && (*ptr<='z'))
{
*ptr = *ptr - ('a'-'A');
}
}
hashnum = hashpjw(str); /* Check if in hash table */
for(temp=NULL,current=HashTable[hashnum];
current!= NULL;
current=current->next)
{
if (strcmp(str,current->lid->name) == 0)
{
temp=current;
break;
}
}
if (temp) /* Yes, found ID then return */
{
temp->lid->count++;
return(temp->lid);
}
else /* Else make our own ID and return that*/
{
temp = MakeLink(tokentype,str,len);
InsertLink(temp,HashTable[hashnum]);
return(temp->lid);
}
}
equname(number,name)
int number;
char *name;
{
ID *temp;
temp = enter(0,name,strlen(name));
temp->value=number;
}
/*BFUNC
getstr() gets a string from the input. It copies the string to
temporary storage before it returns the pointer.
EFUNC*/
static char *getstr()
{
BEGIN("getstr");
char *tmp,*ptr,*bptr;
int i,accum,flag;
if (mylex() != R_STRING)
{
printf("String expected.\n");
if (!(tmp=(char *) malloc(sizeof(char))))
{
WHEREAMI();
printf("Cannot allocate for null string.\n");
exit(ERROR_MEMORY);
}
*tmp='\0';
return(tmp);
}
if (!(tmp=(char *)calloc(strlen(yytext)+1,sizeof(char))))
{
WHEREAMI();
printf("Cannot allocate %d string space.\n",yyleng);
exit(ERROR_MEMORY);
}
for(bptr=yytext+1,ptr=tmp;*bptr!='"';bptr++,ptr++)
{
if (*bptr=='\\')
{
bptr++;
for(flag=0,accum=0,i=0;i<3;i++) /* Octal character lookahead */
{
if ((*bptr>='0')&&(*bptr<='7'))
{
accum = (accum<<3)+(*bptr-'0');
bptr++;
flag=1;
}
else {break;}
}
if (flag) {bptr--;*ptr=accum;}
else
{
switch(*(bptr))
{
case '0':
*ptr = 0;
break;
case 'b':
*ptr = 0x8;
break;
case 'i':
*ptr = 0x9;
break;
case 'n':
*ptr = 0xa;
break;
case 'v':
*ptr = 0xb;
break;
case 'f':
*ptr = 0xc;
break;
case 'r':
*ptr = 0xd;
break;
default:
*ptr=(*bptr);
}
}
}
else {*ptr = (*bptr);}
}
*ptr='\0';
return(tmp);
}
/*BFUNC
parser() handles all of the parsing required for the Program
Interpreter. It is basically a {\tt while} statement with a very
large case statement for every input. All unmatched values-- strings,
brackets, etc. are ignored.
EFUNC*/
#define ARRAYBEGIN if (ntoken==R_LBRACKET)\
{\
arrayflag=1;\
ntoken=mylex();\
}\
if (ntoken!=R_INTEGER)\
{\
WHEREAMI();\
printf("Expected integer.\n");\
break;\
}\
while(1)\
{
#define ARRAYEND if (arrayflag)\
{\
if ((ntoken=mylex())==R_RBRACKET) break;\
else if (ntoken!=R_INTEGER)\
{\
WHEREAMI();\
printf("Expected integer or right bracket.\n");\
break;\
}\
}\
else break;\
}
#define BINARYOP(operation) if (DataLevel<2)\
{\
printf("Not enough operands on stack.\n");\
break;\
}\
accum = *(--DataPtr);\
*(--DataPtr) operation accum;\
DataPtr++;\
DataLevel--;
#define RELOP(operation) if (DataLevel<2)\
{\
printf("Not enough operands on stack.\n");\
break;\
}\
accum = *(--DataPtr); DataPtr--;\
if (*(DataPtr) operation (accum)) *(DataPtr++) = 1.0;\
else *(DataPtr++) = 0.0;\
DataLevel--;
#define openprogram(value)\
PProgram=(value);\
PLStack = ProgramLocalStack[(value)];\
PCStack = ProgramCommandStack[(value)];\
PLLevel = ProgramLocalLevel[(value)];\
PLevel = ProgramLevel[(value)];
#define pushprogram(program,line)\
SourceProgramStack[SourceLevel] = CurrentProgram;\
SourceLineStack[SourceLevel] = CurrentLine;\
SourceLevel++;\
CurrentProgram = program;\
CurrentLine = line;\
CommandStack = ProgramCommandStack[CurrentProgram];\
LocalStack = ProgramLocalStack[CurrentProgram];\
LocalLevel = ProgramLocalLevel[CurrentProgram];\
CommandLevel = ProgramLevel[CurrentProgram];
#define popprogram()\
SourceLevel--;\
CurrentProgram = SourceProgramStack[SourceLevel];\
CurrentLine = SourceLineStack[SourceLevel];\
CommandStack = ProgramCommandStack[CurrentProgram];\
LocalStack = ProgramLocalStack[CurrentProgram];\
LocalLevel = ProgramLocalLevel[CurrentProgram];\
CommandLevel = ProgramLevel[CurrentProgram];
#define GETINTEGER(retval) (retval)=mylex();\
if ((retval)!=R_INTEGER)\
{WHEREAMI();\
printf("Integer expected.\n");\
break;}
void parser()
{
BEGIN("parser");
int i,dest,value,token,ntoken,arrayflag;
double accum;
int hold;
char *sptr;
while(token=mylex())
{
arrayflag=0;
switch(token)
{
case R_INTEGER:
pushdata((double) yyint);
break;
case R_REAL:
pushdata(atof(yytext));
break;
case R_ADD:
BINARYOP(+=);
break;
case R_SUB:
BINARYOP(-=);
break;
case R_MUL:
BINARYOP(*=);
break;
case R_DIV:
BINARYOP(/=);
break;
case R_NOT:
accum = *(--DataPtr);
*(DataPtr++) = (accum ? 0.0 : 1.0);
break;
case R_AND:
RELOP(&&);
break;
case R_OR:
RELOP(||);
break;
case R_XOR:
if (DataLevel<2)
{
printf("Not enough operands on stack.\n");
break;
}
accum = *(--DataPtr); DataPtr--;
if ((*(DataPtr) && !(accum))||
(!(*(DataPtr)) && (accum))) *(DataPtr++) = 1.0;
else *(DataPtr++) = 0.0;
DataLevel--;
break;
case R_LT:
RELOP(<);
break;
case R_LTE:
RELOP(<=);
break;
case R_EQ:
RELOP(==);
break;
case R_GT:
RELOP(>);
break;
case R_GTE:
RELOP(>=);
break;
case R_NEG:
accum = *(--DataPtr);
*(DataPtr++) = -(accum);
break;
case R_SQRT:
accum = *(--DataPtr);
*(DataPtr++) = sqrt(accum);
break;
case R_ABS:
accum = *(--DataPtr);
*(DataPtr++) = fabs(accum);
break;
case R_FLOOR:
accum = *(--DataPtr);
*(DataPtr++) = floor(accum);
break;
case R_CEIL:
accum = *(--DataPtr);
*(DataPtr++) = ceil(accum);
break;
case R_ROUND:
accum = *(--DataPtr);
*(DataPtr++) = ((accum<0)?ceil(accum-0.5):floor(accum+0.5));
break;
case R_DUP:
*(DataPtr) = DataPtr[-1];
DataPtr++;
DataLevel++;
break;
case R_POP:
if (DataLevel)
{
DataLevel--;
DataPtr--;
}
else {printf("Not enough stack elements.\n");}
break;
case R_EXCH:
*DataPtr = DataPtr[-1];
DataPtr[-1] = DataPtr[-2];
DataPtr[-2] = *DataPtr;
break;
case R_COPY:
GETINTEGER(ntoken);
if (DataLevel<yyint)
{
WHEREAMI();
printf("Not enough elements\n");
break;
}
for(i=0;i<yyint;i++)
{
*(DataPtr) = DataPtr[-yyint];
DataPtr++;
DataLevel++;
}
break;
case R_ROLL:
GETINTEGER(ntoken);
dest=yyint;
GETINTEGER(ntoken);
value=yyint;
value = value % dest;
if (value<0) {value+= dest;}
for(i=0;i<value;i++)
{DataPtr[i] = DataPtr[i-value];}
for(i=0;i<dest-value;i++)
{DataPtr[-i-1] = DataPtr[-value-i-1];}
for(i=0;i<value;i++)
{DataPtr[i-dest] = DataPtr[i];}
break;
case R_INDEX:
GETINTEGER(ntoken);
if (yyint > DataLevel)
{
WHEREAMI();
printf("Index out of bounds\n");
break;
}
*DataPtr = DataPtr[-yyint];
DataPtr++;
DataLevel++;
break;
case R_CLEAR:
DataLevel=0;
DataPtr=DataStack;
break;
case R_STO:
if (!DataLevel)
{
printf("Not enough stack elements.\n");
}
ntoken = mylex();
if ((ntoken!=R_ID)&&(ntoken!=R_INTEGER))
{
printf("Integer or label expected.\n");
break;
}
Memory[yyint]= *(--DataPtr);
DataLevel--;
break;
case R_RCL:
ntoken = mylex();
if ((ntoken!=R_ID)&&(ntoken!=R_INTEGER))
{
printf("Integer or label expected.\n");
break;
}
pushdata(Memory[yyint]);
break;
case R_GOTO:
case R_IFG:
case R_IFNG:
case R_EXIT:
WHEREAMI();
printf("Program commands not available on top-level.\n");
break;
case R_EXE:
ntoken = mylex();
if ((ntoken!=R_ID)&&(ntoken!=R_INTEGER))
{
printf("Integer or label expected.\n");
break;
}
pushprogram(yyint,0);
break;
case R_ABORT:
GETINTEGER(ntoken);
exit(yyint);
break;
case R_PRINTSTACK:
for(i=0;i<DataLevel;i++)
{
printf("%d: %f\n",i,DataStack[i]);
}
break;
case R_PRINTPROGRAM:
ntoken = mylex();
if ((ntoken!=R_ID)&&(ntoken!=R_INTEGER))
{
printf("Integer or label expected.\n");
break;
}
openprogram(yyint);
PrintProgram();
break;
case R_PRINTIMAGE:
PrintImage();
break;
case R_PRINTFRAME:
PrintFrame();
break;