COMPILER DESIGN

Detailed explanation-1: -input: An algorithm has zero or more inputs, taken from a specified set of objects. output: An algorithm has one or more outputs, which have a specified relation to the inputs. effectiveness: All operations to be performed must be sufficiently basic that they can be done exactly and in finite length.

Detailed explanation-2: -Input: An algorithm requires some input values. An algorithm can be given a value other than 0 as input. Output: At the end of an algorithm, you will have one or more outcomes. Unambiguity: A perfect algorithm is defined as unambiguous, which means that its instructions should be clear and straightforward.

Detailed explanation-3: -An algorithm must contain a loop. A loop in an algorithm must also include a test for finiteness. Programs containing loops can be verified exhaustively, that is, by trying all cases.

Detailed explanation-4: -An algorithm’s input specifies resources or information that need to exist in advance before the algorithm can be carried out. An algorithm’s output specifies the results that must have occurred by the time the algorithm is finished.