Program for PDA to CFA conversion. - Computer Graphics Source Code in C++

Special : Web Developer's Collection CD-ROM
50,000+ Web Templates, Logos, Cliparts, Scripts. Order Now!

Add to Favorites Make Home Page

2613 Online

Language Categories

Source Codes Home
Project Ideas New!
Interview Questions
FAQs Home
ASP Home: ASP Source Codes; ASP Script Directory New!; ASP .Net Script Directory New!; ASP Interview Questions; ASP FAQs; ASP How Tos
C Home: C Source Codes; C Script Directory New!; C Interview Questions; C FAQs; C How Tos
C++ Home: C++ Source Codes; C++ Script Directory New!; C++ Interview Questions; C++ FAQs; C++ How Tos
Java Home: Java Source Codes; Java Directory New!; Java Interview Questions; Java FAQs; Java How Tos
JavaScript Home: JavaScript Directory New!; JavaScript Source Codes; JavaScript FAQs; JavaScript How Tos
COBOL Home: COBOL Source Codes; COBOL FAQs; COBOL How Tos
Pascal Home: Pascal Source Codes; Pascal FAQs; Pascal How Tos
PHP Script Directory New!
Python Script Directory New!
Perl & CGI Script Directory New!
Flash Script Directory New!
CFML Script Directory New!
Remotely Hosted Scripts New!
Tools & Utilities Directory New!
XML Script Directory New!
Best Programmers: Amit Mathur; Vishal Bhardwaj; Deepesh Jain
Vyom NetWork

Our Services

Get 9,000 Interview Questions & Answers in an eBook.

9500+ Pages
9000 Question & Answers
All Tech. Categories

14 MB Content

Get it now !!

Home » C++ Home » Computer Graphics Home » Program for PDA to CFA conversion.

A D V E R T I S E M E N T

Title	Program for PDA to CFA conversion.
Author	Veeraivelan
Author Email	Veeraivelan [at] yahoo.com
Description
Category	C++ » Computer Graphics
Hits	384043
Code	Select and Copy the Code
#include<iostream.h> #include<dos.h> #include<stdio.h> #include<stdio.h> #include<conio.h> struct pdastate { int type; char sym; int trno; int trans[20]; char tsym[20]; }; class pda { public: int n; pdastate s[30]; pda(void) { n=0; } void show(void); }; void pda::show(void) { pdastate p; clrscr(); for(int i=0;i<n;i++) { p=s[i]; cout<<" " State No " := "<<i; cout<<" " Tag ""; if(p.type==0) cout<<" " Start State ""; else if(p.type==1) cout<<" " Push "<<p.sym<<"""; else if(p.type==2) cout<<" " Pop State ""; else if(p.type==3) cout<<" " Read State ""; else if(p.type==4) cout<<" " Stop State ""; for(int j=0;j<p.trno;j++) { cout<<" " Transition To State "<<p.trans[j]<<"""; if(p.tsym[j]!=0) cout<<" " On Symbol "<<p.tsym[j]<<"""<<endl; else cout<<endl; } getch(); if(i==5) clrscr(); } } union pr { char a; char b[2]; }; struct prod { int type; union pr p; }; class cnf { private: char v[10]; int vno; char t[10]; int tno; struct prod p[30]; int n; int vpr[10]; public: cnf(void); pda mkpda(void); }; cnf:: cnf(void) { clrscr(); char *mess[]={"-","=","["," ","C","F","A"," ","T","O"," ", "P","D","A"," ","]","=","-",}; int xx=31,xxx=48,i,j; _setcursortype(_NOCURSOR); for(i=0,j=17;i<10,j>=8;i++,j--) { gotoxy(xx,1); cout<<mess[i]; xx++; gotoxy(xxx,1); cout<<mess[j]; xxx--; delay(50); } xx=30;xxx=49; _setcursortype(_NORMALCURSOR); cout<<" " Enter No Of Non Terminal Symbols ":= "; cin>>vno; for(i=0;i<vno;i++) { cout<<" " Enter A Non-Terminal Symbol ":="; cin>>v[i]; } cout<<" " Enter The No Of Terminal Symbols ":="; cin>>tno; for(i=0;i<tno;i++) { cout<<" " Enter A Terminal Symbol ":="; cin>>t[i]; } cout<<" " Enter The No Of Productions ":="; cin>>n; int count=0; for(i=0;i<vno;i++) { cout<<" " Enter No Of Productions Corrosponding To The Non-Terminal " <<v[i]<<" ":= "; cin>>vpr[i]; for(int j=0;j<vpr[i];j++) { cout<<" " Enter The Type Of Production <1> A-->b , <2> a-->BC ":="; cin>>p[count].type; if(p[count].type==1) { cout<<" "<<v[i]<<" --> "; cin>>p[count].p.a; } else { cout<<" "<<v[i] <<" --> "; cin>>p[count].p.b[0]; cin>>p[count].p.b[1]; } count++; } } } pda cnf:: mkpda(void) { pda p1; p1.s[p1.n].type=0; p1.s[p1.n].trno=1; p1.s[p1.n].trans[0]=1; p1.s[p1.n].tsym[0]=0; p1.n++; p1.s[p1.n].type=1; p1.s[p1.n].sym=v[0]; p1.s[p1.n].trno=1; p1.s[p1.n].trans[0]=2; p1.s[p1.n].tsym[0]=0; p1.n++; p1.s[p1.n].type=2; p1.s[p1.n].trno=1; p1.s[p1.n].trans[0]=3; p1.s[p1.n].tsym[0]=238; p1.n++; p1.s[p1.n].type=3; p1.s[p1.n].trno=1; p1.s[p1.n].trans[0]=4; p1.s[p1.n].tsym[0]=238; p1.n++; p1.s[p1.n].type=4; p1.s[p1.n].trno=0; p1.n++; int cnt=p1.s[2].trno; int c1=0; prod temp; for(int i=0;i<vno;i++) { for(int j=0;j<vpr[i];j++) { temp=p[c1++]; if(temp.type==1) { p1.s[2].trans[cnt]=p1.n; p1.s[2].tsym[cnt]=v[i]; p1.s[p1.n].type=3; p1.s[p1.n].trno=1; p1.s[p1.n].trans[0]=2; p1.s[p1.n].tsym[0]=temp.p.a; p1.n++; cnt++; } else { p1.s[2].trans[cnt]=p1.n; p1.s[2].tsym[cnt]=v[i]; p1.s[p1.n].type=1; p1.s[p1.n].sym=temp.p.b[1]; p1.s[p1.n].trno=1; p1.s[p1.n].trans[0]=(p1.n)+1; p1.s[p1.n].tsym[0]=0; p1.n++; cnt++; p1.s[p1.n].type=1; p1.s[p1.n].sym=temp.p.b[0]; p1.s[p1.n].trno=1; p1.s[p1.n].trans[0]=2; p1.s[p1.n].tsym[0]=0; p1.n++; } } p1.s[2].trno=cnt; } return(p1); } void main() { cnf c; pda p1; p1=c.mkpda(); getch(); p1.show(); getch(); }

Related Source Codes

Script Name Author

Moving ball screen saver karlmarx

The Classic Game of Snake & Ladder Lakshmi Narayana .A

Railway seat reservation question which comes in sapient VyomWorld

To calculate percentile Ravi Mathur

Send to folder ANIMESH SAHU

Analog clock and calendar Nazia & Rida

HIGH/LOW GAME MOLLY ARORA

Data structure (stack Implimentation) Swapnil B Adsure

Memory Game AnirudhSanyal

Easy Calc Anirudh Sanyal

GK Quiz Anirudh Sanyal

Hangman Game Manish Jain

Snakeman Manish Jain

Full month Calendar Nigi

Cursor shapes nigi

A D V E R T I S E M E N T

Google Groups Subscribe to SourceCodesWorld - Techies Talk

Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

Free Tutorials - HTML, Java, SQL, PHP, ASP, Perl, SQL Tutorials
Discuss Programming Problems and Freshers Jobs related issues here.
Discuss Final Year Project Ideas here.