program functional(input, output);

label 99; {error failure; stop}

type alfa = packed array [1..10] of char;

#include "lex.type.P"      {Lexical Types}
#include "syntax.type.P"   {Syntactic Types}

var prog:tree;

#include "syntax.print.P"  {Print a Parse Tree}
#include "syntax.P"        {The Parser}
#include "strict.exec.P"   {The Interpreter}

begin prog:=parser;
      writeln; writeln(' --- end of parsing --- ');
      printtree(prog); writeln; writeln(' --- running --- ');
      execute(prog);
      99:writeln; writeln(' --- finished --- ')
end.

{\fB Strict Functional Language Interpreter, Main Program. \fP}
{ L. Allison, Dept. Computer Science, Monash University Australia 3168 }
{ http://www.csse.monash.edu.au/~lloyd/tildeFP/Lambda/ }
{Do not remove: Lazy.p, Strict.p, lazy.*.P, strict.*.P, lex.*.P, & syntax.*.P }
{ are released under Gnu `copyleft' General Public Licence (GPL)              }