(FIX): Small file updates.

We won't need a stack yet.
This commit is contained in:
Hayden Hargreaves 2025-10-17 13:15:42 -07:00
parent 7587e493d7
commit 2fdab0134a
3 changed files with 4 additions and 6 deletions

1
.gitignore vendored
View File

@ -3,3 +3,4 @@
/build/* /build/*
parser parser
/.vscode /.vscode
/*.html

View File

@ -4,7 +4,7 @@
The goal is to create a program that reads a file containing text formatted in a simple version of 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 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) ### 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. 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 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 `*` 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. to `\<em\>`. This provides O(1) average-case lookup time.
### Contribution Policy ### Contribution Policy

View File

@ -87,9 +87,6 @@ protected:
*/ */
std::unique_ptr<Node> DOM; std::unique_ptr<Node> DOM;
// NOTE: We need a stack, just not sure what goes in it yet
// std::stack<any> stack;
private: private:
/** /**
* @brief Normalize the input stream. * @brief Normalize the input stream.