about summary refs log tree commit diff stats
path: root/subx
diff options
context:
space:
mode:
Diffstat (limited to 'subx')
-rw-r--r--subx/Readme.md4
-rw-r--r--subx/apps/pack.subx1
2 files changed, 2 insertions, 3 deletions
diff --git a/subx/Readme.md b/subx/Readme.md
index 042f8871..ed09d502 100644
--- a/subx/Readme.md
+++ b/subx/Readme.md
@@ -107,7 +107,7 @@ natively on Linux, and they require only the Linux kernel.
 I'm currently implementing SubX in SubX in 3 phases:
 
   1. Converting ascii hex bytes to binary. (✓)
-  2. Packing bitfields for x86 instructions into bytes.
+  2. Packing bitfields for x86 instructions into bytes. (80% complete)
   3. Replacing addresses with labels.
 
 In parallel, I'm designing testable wrappers for syscalls, particularly for
@@ -126,7 +126,7 @@ This program sums the first 10 natural numbers. By convention I use horizontal
 tabstops to help read instructions, dots to help follow the long lines,
 comments before groups of instructions to describe their high-level purpose,
 and comments at the end of complex instructions to state the low-level
-operation they perform. Numbers are always shown in hexadecimal (base 16).
+operation they perform. Numbers are always in hexadecimal (base 16).
 
 As you can see, programming in SubX requires the programmer to know the (kinda
 complex) structure of x86 instructions, all the different operands that an
diff --git a/subx/apps/pack.subx b/subx/apps/pack.subx
index e1f5d2de..3d70d666 100644
--- a/subx/apps/pack.subx
+++ b/subx/apps/pack.subx
@@ -138,7 +138,6 @@ $main:end:
 #   emit(out : &buffered-file, word : &slice, width : int)
 #     if slice is all hex digits, parse and print appropriate digits
 #     otherwise just write-slice
-#   has-metadata?(word : &slice, s : &string) -> bool
 
 convert:  # in : (address buffered-file), out : (address buffered-file), err : (address buffered-file), ed : (address exit-descriptor) -> <void>
     # pseudocode: