Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re: Object Query Languages and Parsers

by kvale (Monsignor)
on Apr 21, 2006 at 21:54 UTC ( #544990=note: print w/ replies, xml ) Need Help??

in reply to Object Query Languages and Parsers

Regarding object query langugages, you might look at the CORBA system. As an object request broker, it needs to be fast, so the syntax is pretty simple. Of course, it may be too low level, but will give you ideas.

With regard to parsing, I would first create a grammar. I find Parse::RecDescent too slow when speed is of the essence. Writing your own top-down parser should speed things up and for a small grammar, it should be be easy to maintain as well.

Top-down parsers are constructed from a grammar as follows:

  • Each nonterminal in your grammar becomes a subroutine that you call
  • Alternation '|' is handled with if-then statments
  • Qunatifiers like '*' and '+' are handled with loops
  • Nonterminal strings are matched using regexes.
For learning about parsing and translation, I recommend the dragon book: Compilers, by Aho, Sethi, and Ullman.


Comment on Re: Object Query Languages and Parsers

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (5)
As of 2015-11-30 00:21 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (754 votes), past polls