Season of KDE 2020 - ROCS IDE - Add File backends, Week : 1

[Tomaz Canabrava]

Torsten, this is a rocs specific code, nothing will clash with marble.



On Tue, 21 Jan 2020 at 11:55 Torsten Rahn <tackat at t-online.de> wrote:

> I hope this doesn't clash with the existing KML file format which can be
> read by Marble:
>
> https://en.m.wikipedia.org/wiki/Keyhole_Markup_Language
>
> BR
> Torsten
>
>
>
> ------------------------------
> Gesendet mit der Telekom Mail App
> <https://kommunikationsdienste.t-online.de/redirects/email_app_android_sendmail_footer>
>
>
> --- Original-Nachricht ---
> *Von: *Shivam Balikondwar
> *Betreff: *Season of KDE 2020 - ROCS IDE - Add File backends, Week : 1
> *Datum: *21.01.2020, 12:49 Uhr
> *An: *tcanabrava at kde.org, Caio Tonetti, kde-soc at kde.org
>
>
>
> Hi there, Shivam here
> I did research on KML file format , i am working to add support to import
> and export graphs in KML format.
> This is a short explanation of my understanding, I request Caio and Tomaz
> to go through it and help me finalize the grammer for this parser.
>
> KML is an easy to interpret file format written in the form of nested html
> like tags "<>". The attributes( values ) are in the <> </> tag present
> which can be parsed by spirit parser.
> In the past week I did research and studied the spirit boost library.
> I have become familiar with both the parser and generator (qi and karma)
> qi's API , skipper function. Also how the current implementation of rocs
> uses this library to parse the files.
>
> Long story short, i think this grammar definition might be enough for
> importing/exporting graph.
>
> <Graph>   : tells the nested tags will contain, graph nodes, edges etc
>   <id>        :  can be a number, name , etc symbol denoting graph
>   <type>    : digraph(directional), graph specifying the type of graph
> <Node>    :  each node present inside the graph
>   <id>        : a visual id for the node, can be name or digit
>   <unq id> : a unique id to be used later in joining edges.
>   <color>  : node color
>   <style>   : just a generalised definition for all the less required
> attributes like text size, etc
> <Edge>    : contains all the edges and shows how they are interconnected
>   <Nodes>: a comma seperated parameter which will speficy the two nodes
> connect.
> In case of directed graph the parser will assume it to be first points to
> the second. Eg: for a and b nodes it will be as a,b and when its directed
> it will be as a,b but interpreted as a->b
>   <color> : color of the edge
>   <wieght> : wieght of the edge
>   <style>  : other less important attributes.
>
> An example
>
> <Graph>
> <Node>
> <id>A</id>
> <color> blue </color>
> </Node>
> <Node>
> <id>B</id>
> <color> blue </color>
> </Node>
> <Node>
> <id>C</id
> <color> blue </color>
> </Node>
> <Edge>
> <color>
> <connect>
> A,B
> </connect>
> blue
> </color>
> </Edge>
> </Graph>
>
> This above parser can be realised using spirit boost library as used in
> rocs/libgraphtheory/fileformats/grammer files
>
> Looking forward for everyone's reply on what changes are required.
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.kde.org/pipermail/kde-soc/attachments/20200121/341298c4/attachment.html>