The process you describe is not a useful one.  Transforming and re-parsing the entire input after each reduction step would render the parsing process uselessly inefficient, requiring unlimited memory and O(n^2) time.  Parsing a CFG can't be done online with a DFA or NFA.