Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Parsing a macro language

by graff (Chancellor)
on Jul 08, 2005 at 23:06 UTC ( #473605=note: print w/replies, xml ) Need Help??

in reply to Parsing a macro language

My initial reaction would be that pagination is a secondary concern, and that the list of questions is the root of the matter, so I'd start with an array of hashes -- or, if the index-naming of the questions is "non-linear" or "semantic" in some way (i.e. not just an ordered list, but a set of distinctly named entities), then make it a hash of hashes.

In any case, the "outermost, primary" unit of organization is the "question", and features of each question are simply:

  • its position in the sequence (or its ID/name, which is presumably sortable in some way)
  • which page it should be on
  • what its label is
  • what its possible answers are

so the structure could be:

my @questions = [ { page => 'p1', idstr => '4B', label => "... ice cream?", answertype => 'single', answerset => { 1 => 'yes', 2 => 'no' } } ... ]; # or ... my %questions = { '4B' => { page => 'p1', label => '... ice cream?', ... } '4C' => { page => 'p1', label => '... whipped cream?', ... } ... };
As for parsing the input text to fill that structure, there are numerous ways, and Parse::RecDescent would certainly do it (but it might be overkill -- other ways would suffice and be easier if you're really green with P::RD).

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (3)
As of 2023-01-29 02:03 GMT
Find Nodes?
    Voting Booth?

    No recent polls found