its about tech
This is the C program to find the lca using threads and semaphores Given a binary tree (not a binary search tree) and two values say n1 and n2, write a program to find...
This is the CSMA Implementation in java Carrier sense multiple access (CSMA) is a probabilistic media access control (MAC) protocol in which a node verifies the absence of other traffic before transmitting on a...
This is the implementation of public chat in java where the user can chat with each other the server maintains the connection with all the clients Client: bclient.java [cc lang=”java”] import java.io.*; import java.net.*;...
This is the Java Program to Concatenate two strings using TCP,the client sends two strings to the server where these two strings are concatenated and sent back to the client Client Program: ChatClient.java [cc...
This is the lex program to accept class of strings without having the substring bb Lex Program: [cc lang=”c”] %{ #include #include “y.tab.h” %} %% [a-zA-Z0-9]*[b]{2,2}[a-zA-Z0-9]* return VL; [a-zA-Z0-9]* return ER; %% [/cc] YACC...
This is the yacc program to validate variable declaration syntax and semantics using regular expressions Lex Program: [cc lang=”c”] %{ #include #include “y.tab.h” %} %% int|float|char return BUILTIN; “,” return COMMA; “;” return SC;...
This is the Lex Program to identify tokens in a program using regular expressions [cc lang=”c”] %{ #include %} %% bool|int|float printf(“Keyword”); [-,+]?[0-9]+ printf(“Constants”); [,.’”]+ printf(“Punctuation Chars”); [!@#$%^&*()]+ printf(“Special Chars”); [a-zA-Z]+ printf(“Identifiers”); %% main(){yylex();}...
This is the symbol table implementation in yacc using regular expressions,it checks for redeclaration of variables and multiple declarations of variables Lex Program: [cc lang=”c”] %{ #include “y.tab.h” extern char * yylval; int x=0;...
This is the lex program to check parenthesis matching,it checks whether left parenthesis or right parenthesis is missing [cc lang=”c”] %{ #include int l=0,r=0,cbl=0,cbr=0; %} %% [(] l++; [)] r++; [{] cbl++; [}] cbr++;...
This is the lex program to check whether the given string is palindrome or not. [cc lang=”c”] %{ #include char num,temp[100]; int rev=0; char arr[100]; %} %% . scanf(“%s”,arr); temp=arr; while(temp!=0){rev=rev*10+(temp%10); temp/=10;} if(rev==num) printf(“PALI”);...
Recent Comments