JOHN START 0
USING *,15
L 1,FIVE
A 1,FOUR
ST 1,TEMP
FOUR DC F'4'
FIVE DC F'5'
TEMP DS 2F
END
USING *,15
L 1,FIVE
A 1,FOUR
ST 1,TEMP
FOUR DC F'4'
FIVE DC F'5'
TEMP DS 2F
END
Share
Popular Posts
-
#include<stdio.h> #include<string.h> #include<ctype.h> typedef struct{ char arg1,arg2,op,result; char LHS,RHS[20]...
-
#include<stdio.h> #include<string.h> #include<stdlib.h> char POT[][7]={"START","USING","END...
-
MACRO INCR &ARG1,&ARG2,&ARG3 A 1,&ARG1 A 2,&ARG2 A 3,&ARG3 MEND INCR DATA1,DATA2,DATA3 INCR DATA2,DATA3,DATA1 DATA1...
-
#include<stdio.h> #include<stdlib.h> //#include<conio.h> #include<string.h> char ip_sym[15],stack[15]; int ip_ptr=0...
-
#include<stdio.h> #include<ctype.h> #include<string.h> void keyw(char *p); int i=0,id=0,kw=0,num=0,op=0; char keys[32][1...
-
INSERT AN ELEMENT IN SORTED ARRAY #include <stdio.h> void insert_sorted(); int a[50], n, item;... -
XML Introduction Difference between Xml & Html Xml Tree Syntax Rules Namespaces Encoding Viewing & Css Xml Validation Xm...
-
#define SIZE 10 #include<stdio.h> main () { char non_terminal; char beta,alpha; char production[SIZE]; int index=3; ...
-
STRUCTURE PROGRAMMING AND COMPILER CODE 1.FIRST AND FOLLOW 2. ELIMINATION OF LEFT RECURSION 3. SHIFT REDUCE PARSER 4. CODE OPTIMISA...
-
JOHN START 0 USING *,15 L 1,FIVE A 1,FOUR ST 1,TEMP FOUR DC F'4' FIVE DC F'5' TEMP DS 2F END
0 comments:
Post a Comment