The 'gcd' esh plug-in
-----------------------

The 'gcd' plug-in provides functionality to find the greatest common divisor of two integers as a builtin for esh.

It implements the 'process_builtin' method. It reads in two integers as its arguments and uses the Euclidean Algorithm to find their greatest common divisor.

The plugin is run as:
gcd <int 1> <int 2>

and prints that
"The gcd of <int 1> and <int 2> is <gcd>"

--
Written by Noah Luther (nluther@vt.edu) and Conor Patrick (conorpp@vt.edu) Spring 2015 for CS 3214