Hello ladies and gentlemen.

I have been playing with the idea of writing a simple BASIC parser/interpreter, something that would somewhat like Dartmouth BASIC in terms of supported commands, functions, syntax and operators. I've previously had experience writing expression parsers for math(and logic) expressions written in infix notation. I've also implemented a few data structures along the way(singly/doubly linked list, queues, stacks, circular buffers etc.)

So I'm in not new to C++, I'm just clueless as to what I'm supposed to look at to get started with this. I know about recursive decent parsers, but I'm not sure if that would be suitable for this application. Could anyone give me some pointers?

Obviously I know there are a million different BASIC dialects out there, so I could just use any of these if I wanted to write something in BASIC, but this is mainly for my own entertainment/learning. So therefore I'm not looking for a parser generator either, I'm looking for information on how to go about this, on my own.(Possibly with help from this forum if I get stuck)

- Jacob