Non-terminal A is useless if there is no derivation from start symbol to string of tokens in which A appears.
(a) Write a mathematical formulation of this property.
(b) Is it probable that programming language grammar will have useless symbol? Descirbe.
(c) Illustrate that, if grammar has a useless symbol, computation of First and Fellow sets may produce sets that are too large to correctly construct the LL(1) parsing table.