[Rickster0]

lol

[reyben_89]

gabehabe, on 13 Nov, 2008 - 01:07 PM, said:

It's funnier because you can still see where you didn't crop the corners properly.

Future reference: gabehabe~ All lower case. See, this is why I don't call any more.

EDIT: also looks like someone went a little crazy with the clone tool in PS. no2, did you do that, or was it that shoddy when you found it?

testings

[Rickster0]

this makes no sense ???

can anyone answer my Question .

[gabehabe]

...It's already been answered.

Compiler theory. No offence, but I wouldn't say you're ready for it yet.

Heck, I don't think I'm ready for it. But I've got two books on the way.

I'll blog about it soon.

[Rickster0]

oh allright...

[numerical_jerome]

how to make your own programming language.....

1) Start with a Turing Machine
2) Abstract
3) repeat 2 until you have something that looks like an unholy child of english and algebra

note that your mileage may vary

-Jerome

[no2pencil]

gabehabe, on 6 Dec, 2008 - 08:55 AM, said:

I don't think I'm ready for it. But I've got two books on the way.

Same here. I saw a book at a Garage Sale for $2 on Compiler design & so I grabbed it up. It's in really good shape, so the original owner must have read it as much as I have.

[Rickster0]

can someone grab me a link to a good book ?? please

[gabehabe]

The two that I've got are awesome.

Modern Compiler Implementation in C
Compliers: Principals, techniques and tools. (aka the dragon book)

[rahulbatra]

Before reading a book on compilers or even interpreters, I would suggest a book on Programming Language Design and Theory. A lot of thought must go into designing your language before you begin to start implementing a compiler for it like types, paradigm, abstraction levels, basic data structures.

I would suggest (if you really want to put in hard work) to read a minimal language like Scheme first. From there read a language theory book and make choices about the design of your language. See whether you want to make it Turing Complete, whether you want to have support for lambda's. And then only proceed with making a prototype of it.

[Rickster0]

ok ty

[jerryroy]

that is so funny but im curious though about how to create an interpreter

[Rickster0]

?

[dorknexus]

A simple and naieve interpreter would be fairly straight forward to write. I would use Flex for tokenizing and Bison for parsing.

Have the parser generate an Abstract Syntax Tree. Finally, walk the AST, executing code as you go. Fairly straight forward although horrible for performance (that's how Ruby 1.8 and 1.9 do it)

[Sn0wBum]

I was going to suggest Bison as a starting point as well.