package tiny_languages
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Small languages from scratch: Scheme, Lisp, Smalltalk-80, Pascal, BASIC, JavaScript, HTML, CSS and more
Install
dune-project
Dependency
Authors
Maintainers
Sources
0.3.6.tar.gz
md5=7c636383d146d30ac6f2fa234a6253c8
sha512=c79f3823c5f8f57e5038eb640d487c61168b84aa07c61999d6622ef9fd0c890e2b03b4c6a7cdbbe9352a49e25dda00ac7bb14693cee8e3d7beeed251351a2af0
doc/src/tiny_languages.pascal/Pmachine.ml.html
Source file Pmachine.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279(* Claude Code * * Copyright (C) 2026 Yoann Padioleau * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Library General Public License * (LGPL) as published by the Free Software Foundation; either version * 2 of the License, or (at your option) any later version. *) open Pcode (* See Pmachine.mli *) type machine = { program : Pcode.program; store : int array; (* the stack: every frame, and the expressions *) mutable pc : int; mutable sp : int; (* the first free word *) mutable mp : int; (* the current frame *) mutable line : string option; (* the input line being read, and where *) mutable col : int; out : Buffer.t; mutable executed : int; (* instructions so far *) } (* what stops the machine for a while, or for good *) type stop = Halted | Paused | Slice_over | Need_line | Need_random of int | Failed of int * string exception Runtime of int * string (* Turbo Pascal's 64 KB of stack, in words of 16 bits *) let stack_words = 32768 let wrap (n : int) : int = ((n + 32768) land 0xFFFF) - 32768 let push (m : machine) (v : int) : unit = if m.sp >= Array.length m.store then raise (Runtime (202, "Stack overflow")); m.store.(m.sp) <- v; m.sp <- m.sp + 1 let pop (m : machine) : int = m.sp <- m.sp - 1; m.store.(m.sp) let top (m : machine) : int = m.store.(m.sp - 1) (* the frame [d] static links out from the current one *) let base (m : machine) (d : int) : int = let rec go b d = if d = 0 then b else go m.store.(b + 1) (d - 1) in go m.mp d let pad (width : int) (s : string) : string = if String.length s >= width then s else String.make (width - String.length s) ' ' ^ s (*****************************************************************************) (* Reading *) (*****************************************************************************) (* the input line, when there is one left to read from *) let rest (m : machine) : string option = match m.line with Some l -> Some (String.sub l m.col (String.length l - m.col)) | None -> None (* read(i): blanks skipped, the ends of lines included, then the integer; None when a line must be typed first *) let read_integer (m : machine) : int option = match m.line with | None -> None | Some l -> let n = String.length l in while m.col < n && (l.[m.col] = ' ' || l.[m.col] = '\t') do m.col <- m.col + 1 done; if m.col >= n then begin m.line <- None; None end else begin let start = m.col in if l.[m.col] = '-' || l.[m.col] = '+' then m.col <- m.col + 1; while m.col < n && l.[m.col] >= '0' && l.[m.col] <= '9' do m.col <- m.col + 1 done; match int_of_string_opt (String.sub l start (m.col - start)) with | Some v -> Some (wrap v) | None -> raise (Runtime (106, "Invalid numeric format")) end (*****************************************************************************) (* Executing *) (*****************************************************************************) let compare (m : machine) (f : int -> int -> bool) : unit = let b = pop m in let a = pop m in push m (if f a b then 1 else 0) let arith (m : machine) (f : int -> int -> int) : unit = let b = pop m in let a = pop m in push m (wrap (f a b)) (* one instruction; what stops the machine, or None to go on *) let instruction (m : machine) : stop option = let i = m.program.code.(m.pc) in m.pc <- m.pc + 1; let again () = m.pc <- m.pc - 1 in match i with | Ldc n -> push m n; None | Lod (d, o) -> push m m.store.(base m d + o); None | Lda (d, o) -> push m (base m d + o); None | Str (d, o) -> m.store.(base m d + o) <- pop m; None | Ind o -> let a = pop m in push m m.store.(a + o); None | Sto -> let v = pop m in let a = pop m in m.store.(a) <- v; None | Ldm n -> let a = pop m in for k = 0 to n - 1 do push m m.store.(a + k) done; None | Stm n -> m.sp <- m.sp - n; let words = m.sp in let a = pop m in Array.blit m.store words m.store a n; None | Ixa n -> let k = pop m in let a = pop m in push m (a + (k * n)); None | Inc n -> push m (wrap (pop m + n)); None | Chk (lo, hi) -> let v = top m in if v < lo || v > hi then raise (Runtime (201, "Range check error")) else None | Adi -> arith m ( + ); None | Sbi -> arith m ( - ); None | Mpi -> arith m ( * ); None | Dvi | Mod -> if top m = 0 then raise (Runtime (200, "Division by zero")); arith m (if i = Dvi then ( / ) else ( mod )); None | Ngi -> push m (wrap (-pop m)); None | Abi -> push m (wrap (abs (pop m))); None | Sqi -> let v = pop m in push m (wrap (v * v)); None | Odd -> push m (pop m land 1); None | Equ -> compare m ( = ); None | Neq -> compare m ( <> ); None | Les -> compare m ( < ); None | Leq -> compare m ( <= ); None | Grt -> compare m ( > ); None | Geq -> compare m ( >= ); None | And -> arith m ( land ); None | Ior -> arith m ( lor ); None | Not -> push m (1 - pop m); None | Ujp l -> m.pc <- l; None | Fjp l -> if pop m = 0 then m.pc <- l; None | Mst d -> let static = base m d in push m 0; push m static; push m m.mp; push m 0; None | Cup (n, l) -> let frame = m.sp - n - Pcode.mark in m.store.(frame + 3) <- m.pc; m.mp <- frame; m.pc <- l; None | Ent n -> let stop = m.mp + n in if stop >= Array.length m.store then raise (Runtime (202, "Stack overflow")); Array.fill m.store m.sp (stop - m.sp) 0; m.sp <- stop; None | Retp | Retf -> let frame = m.mp in m.pc <- m.store.(frame + 3); m.mp <- m.store.(frame + 2); (* a function's result, in its frame's first word, stays on top *) m.sp <- (if i = Retf then frame + 1 else frame); None | Stp -> Some Halted | Csp c -> ( match c with | Wri -> let w = pop m in Buffer.add_string m.out (pad w (string_of_int (pop m))); None | Wrc -> let w = pop m in Buffer.add_string m.out (pad w (String.make 1 (Char.chr (pop m land 255)))); None | Wrb -> let w = pop m in Buffer.add_string m.out (pad w (if pop m <> 0 then "TRUE" else "FALSE")); None | Wrs s -> let w = pop m in Buffer.add_string m.out (pad w s); None | Wln -> Buffer.add_char m.out '\n'; None | Rdi -> ( match read_integer m with | Some v -> let a = pop m in m.store.(a) <- v; None | None -> again (); Some Need_line) | Rdc -> ( match m.line with | None -> again (); Some Need_line | Some l -> let a = pop m in if m.col >= String.length l then begin (* the end of a line reads as a space *) m.store.(a) <- Char.code ' '; m.line <- None end else begin m.store.(a) <- Char.code l.[m.col]; m.col <- m.col + 1 end; None) | Rln -> ( match m.line with None -> again (); Some Need_line | Some _ -> m.line <- None; None) | Eol -> ( match rest m with None -> again (); Some Need_line | Some r -> push m (if r = "" then 1 else 0); None) | Rnd -> let n = pop m in if n <= 0 then raise (Runtime (201, "Range check error")) else Some (Need_random n)) (*****************************************************************************) (* A machine to pause *) (*****************************************************************************) let start (program : Pcode.program) : machine = { program; store = Array.make stack_words 0; pc = 0; sp = 0; mp = 0; line = None; col = 0; out = Buffer.create 256; executed = 0 } (* instructions until something stops the machine, [k] at most; [pause] asked before each claude: the loop a local function without the optional argument: resume calling itself with ~pause was a tail call natively, but not compiled to JavaScript (a call through the optional argument's closure), and a frame's budget of instructions, a stack frame each, overflowed the browser's stack -- Run froze TinyTurboPascal on the web old: let rec resume ?(pause = ...) m k = ... resume ~pause m (k - 1) *) let resume ?(pause = fun _ -> false) (m : machine) (k : int) : stop = let rec go k = if k = 0 then Slice_over else if pause m then Paused else match instruction m with | None -> m.executed <- m.executed + 1; go (k - 1) | Some stop -> stop | exception Runtime (code, msg) -> Failed (code, msg) | exception Invalid_argument _ -> Failed (204, "Invalid address") in go k let give_line (m : machine) (l : string) : unit = m.line <- Some l; m.col <- 0 let give_random (m : machine) (k : int) : unit = push m k let output (m : machine) : string = let s = Buffer.contents m.out in Buffer.clear m.out; s let pc (m : machine) = m.pc let sp (m : machine) = m.sp let mp (m : machine) = m.mp let word (m : machine) (a : int) = m.store.(a) let executed (m : machine) = m.executed (*****************************************************************************) (* A machine running on a teletype *) (*****************************************************************************) let run (program : Pcode.program) : unit Talk.talk = let m = start program in (* what was written, printed before the machine stops *) let flush (k : unit -> unit Talk.talk) : unit Talk.talk = let s = Buffer.contents m.out in Buffer.clear m.out; if s = "" then k () else Talk.Print (s, k ()) in let rec go () = match resume m 5000 with | Paused -> assert false (* no pause asked *) | Halted -> flush (fun () -> Talk.Done ()) | Slice_over -> flush (fun () -> Talk.Step go) | Need_line -> flush (fun () -> Talk.Read_line (fun l -> give_line m l; go ())) | Need_random n -> flush (fun () -> Talk.Random (n, fun k -> give_random m k; go ())) | Failed (code, msg) -> let line = if m.pc > 0 then program.lines.(m.pc - 1) else 0 in flush (fun () -> Talk.Print (Printf.sprintf "\nRuntime error %d at line %d: %s\n" code line msg, Talk.Done ())) in go () let execute (source : string) (answers : string list) : string = match Pascal_compile.compile source with | Ok p -> Talk.run (run p) answers | Error e -> Printf.sprintf "Error at %d:%d: %s\n" e.line e.col e.message
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>