I note that lines that need to be parsed alike have distinctive beginnings, so I would use that as a starting point. The basic strategy is:

• identify a regex that matches the beginning of each parse-alike group of lines uniquely
• define functions parse each type of line
• in a while loop
  1. read a line
  2. match it to one of the regexs
  3. call the function associated with that regex

For an example of how it is done, see Re: Regular expression. You might also find it helpful to look at the larger discussion of which that node was a part: Regular expression. There are several different approaches in that thread.

Best, beth