Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^2: text processing

by sundialsvc4 (Abbot)
on Apr 23, 2014 at 02:15 UTC ( #1083258=note: print w/ replies, xml ) Need Help??

in reply to Re: text processing
in thread text processing

Actually, David, in this case I do believe that there’s enough information here to point to a classic, awk-inspired solution.   The “set of records of-interest” is clearly bounded by an identifiable “start” and “end” record, and, within that space, the set of records which contain information-of-interest are readily identifiable.   Thus, logic could be written, I think, based only on the file-example presented in the original post.   And this logic would basically be in-keeping with the metaphor that the awk tool already employs.   (Which means, of course, that a very short Perl program could also do the same.)

Comment on Re^2: text processing

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1083258]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2015-12-02 03:06 GMT
Find Nodes?
    Voting Booth?

    My keyboard shows this many letters:

    Results (32 votes), past polls