-
The implementation of the Arithmetical expression is pretty bad, as it just parses and calculates from right to left recursively, it should be changed to actually follow operand precedence, the parsin…
-
# Feedback
## Requirements
- Deployed website: DONE
- GitHub Repo:
- README.md: DONE
- 15 commits: DONE
- Be responsive and built mobile-first, it should work on different screen width…
-
Hi,
I don't know if that's on purpose, but `shouldUnwindOperatorStack()` may end up doing `precedence['(']` (with a simple valid expression such as `(3+1)` it will happen when reaching the `+`), bu…
-
Create a front-end with an easy-to-use DelphiOracleV1 creation UI. Relies on #2 to be completed.
For parsing equations into a valid array of expressions, see: [Shunting-yard Algorithm](https://en.w…
-
## Reason
I would like to start a discussion on **units**. While we've kept saying MOOSE does not have specific units, and that the user has to make sure parameters are provided with consistent uni…
-
The doc point out that Acorn use perator precedence parser to parse binary expression, I am curious which specific algorithm did acorn use, shunting yard or pratt parser or others?
-
## The issue
As I started adding the comma operator (` , `), I ran into an issue: _operator precedence_.
My current understanding is that this issue exists when a language has more than one infix …
-
The source location reported with compiler error messages is not accurate-- for example in [3] below, the error is way down at line 29 (color= "white"), but the reported error [1] is at line 12, at th…
-
Hey, I am a participant of Hacktoberfest and would like to contribute to this repo.
I already have the solution and need the greenflag to upload it.
-
Disclaimer: I have yet to run my code in a production type setting, so don't have a good sense of if this is a real problem or not yet.
But thinking about (for comparison) the Java Pattern class, f…