Share your repls and programming experiences

This is a recursive descent calculator. It uses recursion to both interpret and parse the input. The lexer is just a for loop.

Languages used

bash for the running and node for the logic

Learn

The code should be pretty self-explanatory, but it comes from here and here.

Lexer: Loop through each character of the code and look for things accordingly
Parser: Given a grammar, convert it to javascript. Then, use the definition of lowest precedence to use recursion to go down/up.
Interpreter: Recursively evaluate the tree.

I think the code will help more.

I hope this helps you with your language! It certainly taught me a lot!

Enjoy

Voters

This is so accurate -- I got to mention I hate calculators but this is cool!

WOW EVEN INFINITY

Wow, it even follows Order of Operations. Nice job!

I tried big numbers and it worked

How do you do a carriage return on the console?

wdym, I don't think calculators like carriage returns... @DynamicSquid

@Coder100 oh, I meant what is a carriage return? is it the ENTER key? and isn't that just \n?

oh, not exactly, on older systems, \r had to be along with \n. @DynamicSquid

cool