in reply to advice with Parse::RecDescent
You have some excellent advice above on how to use Parse::RecDescent. My advice to you, however, is not to use it at all.
A recursive descent parser can deal with very complicated grammars, but the one you're dealing with is very simple. As a matter of fact, it looks like you could write a loop that reads a line, then dispatches based on its first three characters. Using a full-blown recursive descent parser in this situation is like swatting a fly with a sledgehammer. (Unless the grammar above is just an illustration and the real one is more complicated.)
As for maintainability: if the code can really be as simple as I've outlined above, then I'd say the simplicity would make a greater contribution to maintainability than the use of a standard module would. In other words, I think reading through a simple read/dispatch loop with four clauses -- HDR, TLR, ADD, DEL -- is as simple (if not simpler) than digesting the grammar above. And simplicity is one of the keys to maintainability.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re(2): advice with Parse::RecDescent
by dmmiller2k (Chaplain) on Dec 10, 2001 at 23:47 UTC | |
|
Re: Re: advice with Parse::RecDescent
by demerphq (Chancellor) on Dec 10, 2001 at 21:51 UTC |