Then i gave a try to write one. this typical bookmarklet firstly ask for few predefined options then extract all the link of matching types. And options are optimized for google filetype : *** search result.

To use copy following lines and then create a bookmark with this text in url.

javascript:w=open('','linkextractor','scrollbars,resizable,menubar');d=document.links;p=prompt('Enter number form bellow list: \n1 \.pdf but not contain google.com \n2 .ppt but not contain google.com\nOr Enter file type without * and . ie svg \nOr Simply keep empty for all links','');var nreg=new RegExp(%22google.com%22);with(w.document){if(p==1){var fileType=%22\.pdf$%22;}else if (p==2){var fileType=%22\.ppt$%22;}else if (p== null || p==%22%22){var fileType=%22.*%22;}else{var fileType=%22\.%22 + p + %22$%22;}var reg=new RegExp(fileType);for(i=0;i<d.length;i++){var s =d[i].toString();if(reg.test(s) == true &&  nreg.test(s) == false ){write(document.links[i].toString() +'<br/>\n');}};void(close());}

How to use:

Firstly search in google using filetype: option (say filetype:pdf binary heap)
the click this bookmark.

will see a prompt, choose a number or type the filetype or left empty to list all.

another window will open, with the list of links. copy it or save it in plain text format use wget or any download manager you like, grab the files.

NB: this is my first bookmarklet, could face error, let me know. And have some idea to develop it.

Epiphany is very light weight browser, built on Gecko engine, never takes time to start. No customization supported by default. There is only one address bar, no default search bar. But the interesting point is this address bar could be used as the replacement of FireFox’s search bar.

Tricks is very simple – Almost all search engine today’s world use GET method to take input search string. As a result the search string is visible in the link address. Just add a bookmark of a result page, while adding bookmark replace the input search string with %s in Address box. that will do the rest. Next time you type a word in address bar the title of this bookmark will be listed below select it for search. This type of bookmarks are called smartbookmarks. Official site. It is also possible to make a serach bar like Firefox by clicking “Show in bookmarks bar” in Bookmark editing mode.

Few smart bookmark search strings

Google Search

http://www.google.com/search?q=%s&ie=UTF-8&oe=UTF-8

Google Bookmark Search

http://www.google.com/bookmarks/find?hl=en&q=%s&btnSMH=Search+Bookmarks

*Wikipedia Search

http://www.wikipedia.org/w/wiki.phtml?search=%s

Yahoo Search

http://search.yahoo.com/bin/search?p=%s

Dogpile Search

http://search.dogpile.com/texis/search?q=%s&geo=no&fs=web&av=custom&engines=goto&engines=looksmart&engines=thunderstone&engines=findwhat&engines=sprinks&engines=directhit&engines=google&engines=infoseek&engines=lycos&engines=kanoodle&engines=opendir&engines=realnames&engines=altavista&engines=yahoo

The Free Dictionary

http://www.thefreedictionary.com/%s

Finally –

In Love of Epiphany for simplicity.

firstly nasm and ddd have to working properly.

Click Settings > Commands

Set Language as Assembler

Fill up the values

Terminal: gnome-terminal --working-directory="$(current.file.dir)" -e "$(anjuta.current.command)"
Compile: nasm -f elf "$(current.file.name.ext)" -o "$(current.file.name).o" -gstab
Build a file: ld -o "$(current.file.name)" "$(current.file.name).o"
Execute: "$(current.full.filename)" $(anjuta.program.arguments)

Click OK

After doing so anjuta is ready for compiling to building and excuting a .asm file

Debugging Configuration:

Click Settings > Tools Editor
Click Add

Fill up the values

Name: DDD Debug (Could be any thing)
Menu location: Debug (Could be any thing)
Command: ddd  "$(current.file.name)"  &
Working Directory: "$(current.file.dir)"

Click OK

Now in time of coding .asm file first build the file and then click Debug > DDD Debug to debug the file.

Actually this information are saved in ~/.anjuta/ folder
i am shearing my configs file. could be pasted in that folder. should be no problem. but i am not sure.

if it worked let me know

Please Note: To work in this way u have to have nasm and ddd working properly

We have stared a new semester in our computer science and engineering graduation. Most of this semester’s courses very important for a computer engineer and should be added another adjective bit difficult. One of those is assembly. Course instructor’s recommendation is to compile and run the code in linux using nasm.

Using no IDE, it is very boring to code. As each time any edition in source file, have to type command to compile and link and finally execute the code. if error occurred then again type command for debugger. Have to waste time for typing commands. In time of programming this is not any programmer willing to do.

Then the universal scripting theory

Linux + Lots of commands + Same commands again and again = Shell Script

And

Linux + Lots of commands + Same commands again and again + Bit different for each file = Shell Script that generates Shell Script for each file.

So I worte a shell script that generates shell script for each .asm file in the current directory. This is my first long shell script.

Script:

<pre>#!/bin/bash

msg="Press Enter to exit ..."

# running a for loop for each asm file in the directory
for name_asm in $(ls | grep ".asm$" )
do
	name=${name_asm%%".asm"}
	name_execute_sh=$name"_execute.sh"
	name_debug_sh=$name"_debug.sh"

	# generating executable sh file

	if (ls | grep "^$name_execute_sh$") then
		echo "Skipping ... , as exists"
	else
		echo "Creating ... $name_execute_sh"
		name_o=$name".o"

		# openning file to write
		exec 4> $name_execute_sh
		echo "#!/bin/bash" >&4
		echo "" >&4
		echo "nasm -f elf $name_asm" >&4
		echo "ld -o $name $name_o" >&4
		echo "echo \"Executing : \$PWD/\$name\"" >&4
		echo "echo \"--------------------------------\"" >&4
		echo "./$name" >&4

		echo "echo \"--------------------------------\"" >&4
		echo "echo -n \"$msg\"" >&4
		echo "read" >&4
		exec 4<&- 		# relezing the file

		# making sh file execute able
		chmod a+x $name_execute_sh
	fi

	#generating debuging sh file

	if (ls | grep "^$name_debug_sh$") then
		echo "Skipping ... , as exists"
	else
		echo "Creating ... $name_debug_sh"
		name_o=$name".o"

		# openning file to write
		exec 4> $name_debug_sh
		echo "#!/bin/bash" >&4
		echo "" >&4
		echo "nasm -f elf $name_asm -gstab" >&4
		echo "ld -o $name $name_o" >&4
		echo "ddd $name &" >&4

		echo "read" >&4
		exec 4<&- 		# relezing the file

		# making sh file execute able
		chmod a+x $name_debug_sh
	fi
done

#suspending the terminal
echo -n $msg
read

Process of Using this script:

Make a script (anyname.sh) using the given code. If u don’t wish to do that. download using this link

paste this .sh file in a directory that contains .asm file. run this script. (may run it double clicking or executing in command prompt). it will generates two sh file one for compiling, linking and executing. and other for compiling, linking and debugging.

Please Note: if you create .sh file make sure, make it executable by invoking

chmod a+x filename


or go to “Properties” of that file and in “Permission” tab, check “Allow executing file as program”. with out doing so u may not be able to double click run it.

Also note that I used nasm as assembler and ddd as debuger. so u have to have this two working before using this.

Introduction:

I developed this game as my term assignment in Level-1 and Term-2 (February – March 2007) in C Programming course. This is my first huge project in C, technically last one (as already have learned C++ and Java).

Brief Description:

This is a typical Pacman game. where player plays as a Pacman who’s object is to eat all the seeds in the board or better I say it maze. In the maze player is not alone. There are enemies, four of them, to catch u. If they catch player loses life. Right now there is four levels. Hope I could increase level in recent future.

Project Detail:

Developing Language: C (could be said C++ as I have used few feature exclusive to c++ but this program is a structured not object oriented one)

Used API: Turbo C’s BGI

Operating System: Windows (though I have developed this project in windows xp sp2, wish that in all version of windows this code would work)

Software Architectural Information:

In my consideration this project could be divided into two part. firstly the algorithmic part and next is display oriented part.

Algorithmic Part:

Main algorithmic part of this code is BFS. BFS is used to calculate the distance of each block of maze. The enemies ran through the shortest path. When I have wrote this code, I didn’t have much knowledge of algorithms. So the code could be little bit frustrating for advanced programmers. As a result new comers will be enjoying the code.

Display Oriented Part:

As already I have specified that this project is developed in Turbo C so the display and color oriented work is done using Turbo C’s BGI. More specifically by drawing raw circle and rectangle. This is very ideal project for those how wanted to do better graphics with TC’s circle and rectangle functions.

Few Screen Shots Taken Using DosBox :

Lastly:

Sharing my one of best creations …. …

Click Here to download the game. This is a zip file where an exe file and other necessary files are given. This game could be run only in windows as this is developed in Turbo C.

]]> http://fahadshaon.wordpress.com/2008/01/21/my-pacman-game/feed/ 6 shaon Pacman Splash Screen ্্Pacman Begining Level Pyramid Rectangular Two Cities Spiral Pacman Game Over Download http://fahadshaon.wordpress.com/2008/01/18/prefix-to-postfix-stack-emplementation/ http://fahadshaon.wordpress.com/2008/01/18/prefix-to-postfix-stack-emplementation/#comments Fri, 18 Jan 2008 06:24:21 +0000 Fahad http://fahadshaon.wordpress.com/2008/01/18/prefix-to-postfix-stack-emplementation/ ]]> It’s been long time. sorry to them those who want some explanation from me. was bit busy can’t give enough time for blogging. but now i have sorted out that “i will always be busy”. so if i want to continue blogging then i have to write something on the fly.

For them who have got some help “Prefix to Postfix using Binary Teer”. Here same code is implemented using stack. But keep in mind that if case of implementation using stack binary tree is not used at all.

Here is a pdf file discribing the algorithm. Prefix to Postfix using Stack Algorithm

Here is the code written in C++

#include <iostream>
#include <stack>
using namespace std;

#define MAX 100
#define LEFT_DONE '#'

bool isOperator(char ch){
    return ch=='+' || ch=='-' || ch == '*' ||
        ch == '/' || ch == '$' || ch == '%';
}

int main(){

	//e input expression and p output expression
	char e[MAX],p[MAX];
	stack<char> stk;

	cout << "Enter a prefix : ";
	cin >> e;

	int j=0;
	//until the end of expression riches
	for (int i=0;e[i];i++){ 

		if(isOperator(e[i])){
			stk.push(e[i]);
		}
		else {
			p[j++]=e[i];

			while(!stk.empty() && stk.top()==LEFT_DONE){
				stk.pop();
				p[j++]=stk.top();
				stk.pop();
			}
			stk.push(LEFT_DONE);
		}
	}
	p[j]=0;
	cout << "Postfix expression is :" << p << endl;

	return 0;
}

This section is Updated later:

I wanted to explain a lot but i can’t because of time. have lots of thing to share. firstly i have made a power point slide that actually simulates how a binary expression tree is made from a prefix expression. hope this will at least help to understand the logic behind the conversion. click this link Prefix to Expression Tree Simulation

Updated section ends here

Here is the code of prefix to binary tree(arrayed implementation).

#include<iostream>
using namespace std;

#define MAX 100
int count=1;
char e[MAX],b[2*MAX];

bool isOperator(char ch){
    return ch=='+' || ch=='-' || ch == '*' ||
        ch == '/' || ch == '$' || ch == '%';
}

void left(char,int);
void right(char,int);

void left(char op,int i){

    if(isOperator(op)){

        b[2*i]=op;
        count++;
        left(e[count],2*i);
        right(e[count],2*i);
    }
    else
    {
        b[2*i]=op;
        count++;
    }
}

void right(char op,int i){

    if(isOperator(op)){

        b[2*i+1]=op;
        count++;
        left(e[count],2*i+1);
        right(e[count],2*i+1);
    }
    else
    {
        b[2*i+1]=op;
        count++;
    }
}

void postorder(int i){
    if(isOperator(b[i]))postorder(2*i);
    if(isOperator(b[i]))postorder(2*i+1);
    cout << b[i] ;

}

int main(){

    cout << "Enter a prefix : ";
    cin >> e;
    int len=strlen(e);

    count=0;
    b[1]=e[count];

    count++;
    left(e[count],1);
    right(e[count],1);

    postorder(1);

    return 0;
}