sharad + self-modifying   181

20-, 24-, 32-bit x86 tools
Use the CPU view when you need to work at the assembly language level. ... 20-, 24- and 32-bit compiler, assembler, linker, locate utility, and debugger ... optional in-circuit emulator interface for full access to hardware resources. JTAG interface support ... 3301 Country Club Road, Suite 2214. Endwell, NY 13760 ...
emulator  sal  simple  assembly  language  simulator  cpu  assembler  development  memory  programming  tutorial  sim  cpusim  smc  selfmodifying  self-modifying  Delicious 
october 2010 by sharad
Design of ASIPs in multi-processor SoCs using the Chess/Checkers ...
assembler and disassembler, and a retargetable linker. 2) Checkers: a retargetable instruction-set simulator .... simulator, and hardware generator directly operate on this .... architecture, featuring a high degree of instruction-level ... [4] “Chess/Checkers: a retargetable tool-suite for embedded processors – ...
citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.95.795&rep...
emulator  sal  simple  assembly  language  simulator  cpu  assembler  development  memory  programming  tutorial  cpusim  sim  smc  selfmodifying  self-modifying  Delicious 
october 2010 by sharad
First-class, run-time macros from meta-circular evaluators
Matt Might Course http://michaux.ca/articles/scheme-from-scratch-introduction http://matt.might.net/ First-class macros are macros that can be bound to variables, passed as arguments and returned from functions. First-class macros expand and evaluate syntax at run-time. Meta-circular evaluators support a concise implementation of first-class macros. In fact, first-class macros are easier to implement than traditional compile-time macros. A meta-circular evaluator is an interpreter which (1) can evaluate itself and (2) implements each language construct in terms of itself. This article and the attached implementation explain how to implement first-class macros in a meta-circular evaluator.
asm  nasm  as  self-modifying  selfmodifying  smc  implement  implementation  lisp  scheme  compiler  c  machine  code  binary  declarative  imperative  sbcl  defcode  masm  assembly  clisp  assembler  matt  might  course  Delicious 
july 2010 by sharad
« earlier      
per page:    204080120160

related tags

ai  aima  algorithm  allegro  allegrograph  api  archive  arm  art  articles  Articles/Tech  as  asm  assembler  assembly  atnt  automata  automatic  bare  barebone  binary  biology  bios  board  bochs  bochs-bios  bochs/vga  book  books  boot  buy  bytecode  c  call  call/cc  callcc  Calling  cc  cl  cl-xml  clang  clean  clisp  closure  code  code-to-generate-code  codegeneration  combinator  comment  common-lisp  compilation  compiler  compilers  compiling  computer  computerscience  Concurrent  consultant  continuation  continuations  Continued  conts  Conventions  course  courses  cps  cpu  cpusim  cs  culture  dd  declarative  defcode  Delicious  design  dev  deve  developing  development  Disassembly  dotnet  dream  drscheme  DSSSL  duplicate  duplication  dynamic  ebook  elf  elisp  emacs  emulation  emulator  engineering  env  erlang  error  essay  essays  excellent  exception  fromstart  function  fundamental  future  futurism  futurist  gambit  gas  geek  generation  gnu  good  great  greate  ground  gsxml  hack  hacking  hex  hexl  history  hla  htdp  hyperspace  hyperspec  i386  i686  idt  image  imperative  implement  implementation  inspiration  int  intel  interesting  interpretation  interpreter  interrupt  io  irq  irregular  irregularity  isr  java  javascript  jit  kernel  kit  klee  kr  kvm  lambda  lambdapaper  lang  language  languages  learning  light  lightn  lightning  linux  lisp  literature  llvm  lsip  machine  macro  manifesto  manifestos  manual  masm  math  matt  media  memory  metaprogramming  might  minimal  mining  mistake  ml  mode  monad  monads  msp  mustsee  nasm  ocaml  opcode  optimization  org  orgmode  os  oskit  paip  paper  paradigam  parrot  pc  pcastl  pdf  philosophy  pic  plan  planner  plex  plex86  politics  polymorphic  ppai  problem  processor  program  programming  prolog  python  qemu  quaject  quine  rdf  readit  readlater  reference  reflection  reflective  reflexive  remember  remind  reminder  replication  research  reson  resoning  ror  ruby  run  runtime  sal  sapna  sbcl  scala  schedular  scheme  science  scratch  scsch  seabios  security  self  self-modifying  selfmodifying  semantic  setup  sheet  sicp  sim  simple  simulator  slime  small  smc  software  Squeak  stackoverflow  stag  staging  start  structure  style  stylesheet  swank  sxml  syntax  synthesis  synthesys  system  t  t3  tc  tech  texas  text  thread  tiny  todo  toread  tprj  tproject  Transformational  TransformationalCompiler  tutorial  type  unix  usb  vergin  verification  versatile  very  vga  virtual  virtualization  virus  vm  vmware  web  wiki  writing  x86  xebra  xml  xsl  xslt  Xuriella  Y  Ycombinator  zero 

Copy this bookmark:



description:


tags: