Lec11 F | Leftmost and Rightmost Derivations in Parse Tree

Lec11 F | Leftmost and Rightmost Derivations in Parse Tree

Parse trees are the data structure to describe proceedings in a context free grammar. Here in this video, two ways to draw a parse tree for given string traversal are discussed, being left most derivations and right most derivations. #parsetreeforcfg #leftmostderivation #rightmostderivation #stringderivationincfg