From 2fdab0134a08ad415b75ffa05afd77d700fa171b Mon Sep 17 00:00:00 2001
From: Hayden Hargreaves <hhargreaves2006@gmail.com>
Date: Fri, 17 Oct 2025 13:15:42 -0700
Subject: [PATCH] (FIX): Small file updates.

We won't need a stack yet.
---
 .gitignore   | 1 +
 input.md     | 6 +++---
 lib/parser.h | 3 ---
 3 files changed, 4 insertions(+), 6 deletions(-)

diff --git a/.gitignore b/.gitignore
index 3943bed..be655f3 100644
--- a/.gitignore
+++ b/.gitignore
@@ -3,3 +3,4 @@
 /build/*
 parser
 /.vscode
+/*.html
diff --git a/input.md b/input.md
index 77ed442..c031c06 100644
--- a/input.md
+++ b/input.md
@@ -4,7 +4,7 @@
 
 The goal is to create a program that reads a file containing text formatted in a simple version of 
 Markdown and converts it into a valid HTML file. The program will need to identify and translate 
-specific syntax (e.g., `# Heading` to `<h1>Heading</h1>`, `*text*` to `<em>text</em>`).
+specific syntax (e.g., ` Heading` to `\<h1\>Heading\</h1\>`, `*text*` to `\<em\>text\</em\>`).
 
 
 ### Implementation Requirements (Generated by Gemini)
@@ -42,8 +42,8 @@ that all tags are correctly opened and closed. Your presentation can visually de
 with a stack diagram.
 
 Hash Map or Map: A hash map (std::unordered_map) or a map (std::map) can be used to efficiently store
-and retrieve the HTML equivalent for each Markdown tag. For example, you could map `#` to `<h1>`or `*`
-to `<em>`. This provides O(1) average-case lookup time.
+and retrieve the HTML equivalent for each Markdown tag. For example, you could map `#` to `\<h1\>`or `*`
+to `\<em\>`. This provides O(1) average-case lookup time.
 
 
 ### Contribution Policy
diff --git a/lib/parser.h b/lib/parser.h
index 509f1d6..cd24c74 100644
--- a/lib/parser.h
+++ b/lib/parser.h
@@ -87,9 +87,6 @@ protected:
    */
   std::unique_ptr<Node> DOM;
 
-  // NOTE: We need a stack, just not sure what goes in it yet
-  // std::stack<any> stack;
-
 private:
   /**
    * @brief Normalize the input stream.