A more generalized way to handle such requirements is with a Finite-State Machine (FSM) approach. The algorithms consider, not only the current line of input, but the $state that the FSM is “in” at the time, where the current value of $state is determined by recent history of lines seen.Sounds cool. I found a lot of interesting hits using Super Search:
In reply to Re^2: Read Between the Lines
by eyepopslikeamosquito
in thread Read Between the Lines
by SuzuBell
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |