<feed xmlns='http://www.w3.org/2005/Atom'>
<title>qc/src/expr.rs, branch main</title>
<subtitle>A minimalist desktop calculator app written in blazingly fast™ Rust</subtitle>
<id>https://code.roseh.moe/qc/atom/src/expr.rs?h=main</id>
<link rel='self' href='https://code.roseh.moe/qc/atom/src/expr.rs?h=main'/>
<link rel='alternate' type='text/html' href='https://code.roseh.moe/qc/'/>
<updated>2024-05-31T06:50:59Z</updated>
<entry>
<title>Add bytecode.</title>
<updated>2024-05-31T06:50:59Z</updated>
<author>
<name>Rose Hogenson</name>
<email>rosehogenson@posteo.net</email>
</author>
<published>2024-05-31T06:50:59Z</published>
<link rel='alternate' type='text/html' href='https://code.roseh.moe/qc/commit/?id=311d3ae9a3b0a014e14e885ddbdf35a6c1cfd3ce'/>
<id>urn:sha1:311d3ae9a3b0a014e14e885ddbdf35a6c1cfd3ce</id>
<content type='text'>
A recursive AST is kind of annoying to evaluate without recursion.
Bytecode is cooler anyway.
</content>
</entry>
<entry>
<title>Replace recursive evaluation with stacks.</title>
<updated>2024-05-31T05:30:31Z</updated>
<author>
<name>Rose Hogenson</name>
<email>rosehogenson@posteo.net</email>
</author>
<published>2024-05-31T05:30:31Z</published>
<link rel='alternate' type='text/html' href='https://code.roseh.moe/qc/commit/?id=da297e692c4131eac3631b8440561c8dbc78f480'/>
<id>urn:sha1:da297e692c4131eac3631b8440561c8dbc78f480</id>
<content type='text'>
I think recursion is undefined behavior in Rust.
</content>
</entry>
<entry>
<title>Write tests for parser.</title>
<updated>2024-05-31T04:09:54Z</updated>
<author>
<name>Rose Hogenson</name>
<email>rosehogenson@posteo.net</email>
</author>
<published>2024-05-31T03:00:08Z</published>
<link rel='alternate' type='text/html' href='https://code.roseh.moe/qc/commit/?id=5e88902a161674605c6835c7be96d412d82e7dd4'/>
<id>urn:sha1:5e88902a161674605c6835c7be96d412d82e7dd4</id>
<content type='text'>
</content>
</entry>
</feed>
