anchor.diff:  import HirschA::*;
   import Hirsch::*;
   
  -interface MCSAlgorithm;
  -   method Action setupA (Bit#(7) strLen);
  -   method Action setupB (Bit#(7) strLen);
  -   interface FSM fsm;
  -endinterface;
   
   /* This module solves the maximum common subsequence problem.
    * It finds the longest subsequence of characters present in both input strings
  
positive.code: import BRAM::*;
  //import Gearbox::*;
  import Connectable::*;
  
  //import AxiMasterSlave::*;
  import Dma::*;
  
negative.code: // Copyright (c) 2014 Quanta Research Cambridge, Inc.
  
  // Permission is hereby granted, free of charge, to any person
  // obtaining a copy of this software and associated documentation
  