For 10 points, name these programs that typically map grammar symbols to data elements based on the rules of a particular grammar, and are present in compilers.
When applied to charts, these programs can employ Earley's algorithm, and the CYK algorithm can be used to counter the local and global ambiguity problems these programs face. They can be created by programs such as Yacc, provided there is a valid Backus-Naur notation. When they employ a stack to push symbols through cycles of shifting followed by reduction, they are bottom up, and when they process input strings from left to right using leftmost derivations they are known as predictive or top-down. For 10 points, name these programs that typically map grammar symbols to data elements based on the rules of a particular grammar, and are present in compilers.
When applied to charts, these programs can employ Earley's algorithm, and the CYK algorithm can be used to counter the local and global ambiguity problems these programs face.
parsers [or parsing; prompt on "compiler"]