Java代写代考

1 Recap Simulating Things Peter Dixon March 1, 2021 A Turing machine is like a DFA with memory. It has 1. an input alphabet Σ (that doesn’t contain or ⊢) 2. a tape alphabet Γ that contains Σ and two special characters 3. states Q, including 3 special states Start s, Accept t, and Reject

package typelang; import java.util.ArrayList; import java.util.List; import typelang.AST.*; import typelang.Env.ExtendEnv; import typelang.Env.GlobalEnv; import typelang.Type.*; public class Checker implements Visitor { Printer.Formatter ts = new Printer.Formatter(); Env initEnv = initialEnv(); //New for definelang private Env initialEnv() { GlobalEnv initEnv = new GlobalEnv(); /* Type for procedure: (read ). Following is same as (define read (lambda (file)

package typelang; import java.util.List; import typelang.Type; import typelang.AST.Exp; public class Printer { public void print(Value v) { if(v.tostring() != “”) System.out.println(v.tostring()); } public void print(Type t) { if(t.tostring() != “”) System.out.println(t.tostring()); } public void print(Exception e) { System.out.println(e.toString()); } public static class Formatter implements AST.Visitor { public String visit(AST.AddExp e, Env env) { String result

grammar TypeLang; // Grammar of this Programming Language // – grammar rules start with lowercase program returns [Program ast] locals [ArrayList defs, Exp expr] @init { $defs = new ArrayList(); $expr = new UnitExp(); } : (def=definedecl { $defs.add($def.ast); } )* (e=exp { $expr = $e.ast; } )? { $ast = new Program($defs, $expr); }