This article provides a survey of evaluators for Attribute Grammars (AG) known to the author from the literature. Attribute grammars are grammars whose productions have values associated with their terminal and nonterminal symbols (cf. Lewis et al. [1] for the original discussion of these grammars). An evaluator for AG is a program that computes the values associated with the symbols in a syntactic tree derivation of a sentence in AG. An evaluator-generator is a program that can construct an evaluator for some AG. The survey includes discussions of the types of evaluators, their properties and relationships, and the properties of their corresponding attribute grammars. There are also some discussions of evaluation time, space, and size. The significance of the survey is in the conclusion by the author that all evaluators in a certain class can be viewed as particular cases or generalizations of the iterative and recursive tree-walking evaluators related to the :0U1-ordered AG.