... INTRODUCTION TO COMPUTER SCIENCE HANDOUT #10. PARSINGK5 & K6, Computer Science Department, Vaên Lang UniversitySecond semester Feb, 2002Instructor: Traàn Ñöùc QuangMajor ... labels of the children of v, from the left, form the body of the production.56 INTRODUCTION TO COMPUTER SCIENCE: HANDOUT #10. PARSING5. Three parse trees below are constructed by the production (1), ... 7.<N><D><N><D>14<E><N><D>2(b)<N><D>3(a)(c)<E><E><E>+<N><D><N><D>14<E><N><D>2<E> 10. 2 CONSTRUCTING A PARSE TREE 551. First, construct a one-node tree for each terminal in the tree.3 * ( 2 + 1 4 )2. For the terminals 1, 2, 3, and 4, apply the productions (7) to get...