Let Grammar be with these transitions:
S -> a{print "0"}A
A -> b{print "1"}B
A -> c{print "2"}
A -> ε{print "-"}
B -> d{print "1"}A
B -> ε{print "0"}
What is the output produced for input string abdbdc using Bottom-Up Parsing with above translations:
A) 0211-10
B) 0211110
C) 0111-20
D) 0111012