p1.1 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Daniel Mihai Problem 1.1 The parse tree P e The equivalent tree to P e The parse tree of e is G e =<E,V,f> V={v 1 ,v 2 ,v 3 ,v 4 ,x 1 ,x 2 ,x 3 ,x 4 }, E={<v 1 ,v 2 >,<v 2 ,x 1 >,<v 1 ,v 3 >,<v 3 ,v 4 >,<v 3 ,x 4 >,<v 4 ,x 2 >,<v 4 ,x 3 >} f(v 1 )=+,f(v 2 )=-,f(v 3 )=*,f(v 4 )=+ The Graph represented in the right image G=<E,V>, E={1,2,3,4,5,6,7,8} and
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: V={&lt;1,2&gt;,&lt;1,7&gt;,&lt;7,8&gt;,&lt;2,3&gt;,&lt;2,4&gt;,&lt;4,5&gt;,&lt;4,6&gt;} is equivalent to G e because there exist an isomorphism between G and G e ....
View Full Document

Ask a homework question - tutors are online