Parsers have always intrigued me for reasons I cannot clearly explain. Parsers are programs able to take an input text and reorganize it in a structured way. Parsers “get the tree out of flat text”.  There are many kinds of parsers.  Each and every one of them deals with its own “language”. The language of a parser is the set of strings that it will accept.  These need not be the valid strings for a programming language.  they can just as well be some language you make up to make your program scriptable. The only required constraint on the language is that it has a clearly defined structure. This was recognized lots of years ago.  To formalize the definition of such languages, the EBNF (Extended Backus Naur Form) was developed.

In this article I will use that notation (although not to the letter).

Since this article is big, I had to split it up into multiple sections.  You can jump right to the topic you want :

Subitems :

[OO Parsing]
[IParser]
[Basic Parsers]
[Actions]
[Remarks]
[VBParser]