anchor.diff:  import BRAM::*;
   //import Gearbox::*;
   import Connectable::*;
  +import MCSAlgorithm::*;
   
   //import AxiMasterSlave::*;
   import Dma::*;
  
positive.code: // Copyright (c) 2013 Quanta Research Cambridge, Inc.
  
  // Permission is hereby granted, free of charge, to any person
  // obtaining a copy of this software and associated documentation
  
negative.code: import HirschA::*;
  import Hirsch::*;
  
  
  /* This module solves the maximum common subsequence problem.
   * It finds the longest subsequence of characters present in both input strings
  