Re: The new GEDCOM parser
[email protected] (Ron Savage) Wed, 07 Nov 2012 09:10:51 +1100
| Newsgroups | perl.gedcom |
|---|---|
| Message-ID | <[email protected]> |
Hi Chris On 07/11/12 06:27, Chris Clonch wrote: > Hi everybody! > > With a graph theory connection, you could easily implement Randy > Wilson's ideas [1] on merging GEDCOMs. I've attempted to give thought to > how this could be implemented with Graph.pm (as seen in O'Reilly's > Algorithms with Perl) & Gedcom.pm but I couldn't wrap my brain around > the ins and outs of the data as a graph. Guess I'll have to reassess the appropriateness of Graph.pm. I may well have to use it. > Like Jeremy stated, if a solid parser is written, then it would likely > be trivial (for others :) to extend using graph, tree, whatever for > advanced manipulation of the data. And the reverse could be true, > additional lexer's could be wrote to slurp in XML, FOAF, etc that comes > down the road... > > Got me excited again! Good! > 1. http://synapse.cs.byu.edu/~randy/gen/Remerge.html Thanx for the reference. -- Ron Savage http://savage.net.au/ Ph: 0421 920 622