From 9b55b9ec32f2f7db135911c112c6a461545b8246 Mon Sep 17 00:00:00 2001
From: Aryadev Chavali <aryadev@aryadevchavali.com>
Date: Thu, 29 Jan 2026 05:42:16 +0000
Subject: [PATCH] arl.org: rewrite parser bit

---
 arl.org | 15 ++++++++-------
 1 file changed, 8 insertions(+), 7 deletions(-)

diff --git a/arl.org b/arl.org
index c368639..72a5d83 100644
--- a/arl.org
+++ b/arl.org
@@ -1,5 +1,6 @@
 #+title: ARL - Issue tracker
 #+date: 2026-01-23
+#+filetags: arl
 
 * TODO Write a minimum working transpiler
 We need to be able to compile the following file:
@@ -23,13 +24,13 @@ It's a Eulerian Path from the source code to the native executable.
 [[file:src/parser/]]
 [[file:include/arl/parser/]]
 
-We need to generate some form of AST from the token stream.  We want
-something a stage above the tokeniser so it should distinguish the
-following cases:
-- Literal value
-- Primitive call
-*** TODO AST design
-*** TODO Token Stream to AST implementation
+We need to generate some form of AST from the token stream.  This
+should be a little more advanced than our initial stream,
+distinguishing between
+- Literal values
+- Primitive calls
+- References to otherwise undefined words (may be defined through
+  import or later on)
 ** TODO Stack effect/type analysis
 [[file:src/analysis/]]
 [[file:include/arl/analysis/]]