if there is no semantic action associated with SDT can we still be able to find out what type of STD it is .

Question

Either L attribute or S attributed .

What kind of SDT it is  ?

S --->E#   Out('#')

E ---> E+E   Out('+')

E --->T

T ---> T#F   Out('*)

T ---> F

F ---> (E)

F ---> a   Out ('a')

For the sentence a+a+a

What will be the final Output of it ?

Answer 1

It is S attributed as the attributes are depending on their child

Let me know if anything is wrong

Comments

@sekhar parse tree as per order of presedence....

---

@shekhar yes as the tree is evaluated from all it's children , so it is a S attributed ,

+ is left associative, So, if the parse tree is evaluate from left to right it will be more accurate

---

if the string is in the form of a+a+a then we have to evaluate by using left associativity but u made this as right associativity i think thats why u got a diff ans

i got ans as    aa+a+#

Answer 2

S attribute....aaa++# ...every S attribute is L attribute ...but every L need not be S.