[Asterisk-java-users] parsing dial plan extension patterns

[Aaron E. <aar...@gm...>]

Hi all,

I didn't see anything in the asterisk java API for parsing dial plan
extension patterns and I suppose it might be beyond the scope of the
problems the API solves anyway.

But I was wondering if anyone knows of any utilities out there for
parsing patterns.

Specifically, I'd like to be able to parse a pattern and determine:

1. If the set of possible matches is bounded or not (ie. fixed length).
2. In the case of bounded sets, whether it is purely numeric.
3. Some kind of match function to see if a given string matches the
pattern (perhaps by converting to a regular expression). It would be
cool if the match pattern could also accept a caller ID number as well
in case there is a filter there as well.
4. In the case of bounded sets, being able to iterate through the possibilities.

I realize this is quite a laundry list. I'll need to implement
something myself for my specific cases if there is nothing out there
already...

-aaron