Bottom-up parsin for dot grammar.

Cancelled Posted Jun 15, 2014 Paid on delivery
Cancelled Paid on delivery

Use a bottom-up parsing tool to construct a parser for the dot grammar. The choice of tool is up to you. Then use that tool to construct an intermediate representation of the input graph. The choice of intermediate representation could be a graph, tree, or basically any other representation that you want.

Turn in your grammar file (that you feed into your parser tool) along with some evidence that the parser tool accepts your grammar and produces a parser. Also turn in any code that you had to write to generate an intermediate representation. Some tools will generate a parse tree or an AST for you. If you choose to use that representation, you don’t need to turn in anything else. However, if you are creating the intermediate representation yourself, please submit your code.

You can find the grammar at [url removed, login to view]

Create the parser for the following code:

digraph G {

main [shape=box]; /* this is a comment */

main -> parse [weight=8];

parse -> execute;

main -> init [style=dotted];

main -> cleanup;

execute -> make_string;

init -> make_string;

main -> printf [style=bold,label="100 times"];

make_string [label="make a\nstring"];

node [shape=box,style=filled,color=".7 .3 1.0"];

execute -> compare;

}

PHP Software Architecture

Project ID: #6071172

About the project

1 proposal Remote project Active Jun 18, 2014

1 freelancer is bidding on average $84 for this job

srinichal

I am an expert in delivering custom scripts and willing to discuss further about the project specs .

$84 USD in 3 days
(114 Reviews)
7.2
xpertzsoft

Hello Sir, We have gone through the details you have provided and we have already worked on a similar project before and can deliver as u have mentioned and would be pleased to work on this with you to deliver the resu More

$39 USD in 1 day
(0 Reviews)
0.0