More on recursive descent

My program to parse that complicated set of measurement data is slowly progressing. It teaches myself a lot about the nature of recursion, the Backus-Naur-Form (BNF) and how to make a parse tree. On a side-note recursion teaches to break a cyclical structure into a short description, on each level of the description something is added (or removed depending on the direction) and the description gets more abstract. Of course with every abstraction layer where parts of a description are removed we lose information but that information can be re-constructed from the parse tree.