https://github.com/innovativeinventor/hscalc

Various implementations of a command-line calculator in Haskell (with monadic parsing, functors, combinators, and lambda expressions!)
https://github.com/innovativeinventor/hscalc

Last synced: 3 months ago
JSON representation

Various implementations of a command-line calculator in Haskell (with monadic parsing, functors, combinators, and lambda expressions!)

• Host: GitHub
• URL: https://github.com/innovativeinventor/hscalc
• Owner: InnovativeInventor
• License: bsd-3-clause
• Created: 2020-08-19T17:16:34.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2020-08-19T19:07:24.000Z (almost 6 years ago)
• Last Synced: 2025-02-26T14:45:26.995Z (over 1 year ago)
• Language: Haskell
• Size: 351 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: ChangeLog.md
  • License: LICENSE

Awesome Lists containing this project

README

          
## hscalc

[![asciicast](https://asciinema.org/a/354394.svg)](https://asciinema.org/a/354394)

A simple command-line REPL calculator utility with various styles of implementation. 

Monadic parsing, functors, combinators, and lambda expressions galore!

Not ready for real use yet.

There are two implementations so far. 

One of them is a naive recursive parsing implementation (no monadic parsing). 

This is the utility you'll get if you compile this project (in `/src/Lib.hs`).

With the exception of parens, this utility should respect the order of operations and have the 4 basic arithmetic expressions.

```bash

stack build

stack exec hscalc-exe

```

The other one is in `/src/Parser.hs` and is a start at a proper monadic recursive parser.

The monadic parser still needs some work.

--- 

TODO

- [ ] proper parens parsing

- [ ] get monadic parser to respect order of operations

- [ ] allow for efficient factoring and checking if prime (may be useful for CTFs)