A recursive$-$descent parser has a subprogram for each non$-$terminal symbol in the grammar, which can parse sentences generated by that non$-$terminal.

True

False