|
|
|
|
|
by olamide203
1397 days ago
|
|
hyoka uses a full recursive descent parser to parse expressions into AST, then evaluates to get the final result. it is very secure for math expressions unlike the eval function which can run javascript code.
you can try out a demo here
https://codesandbox.io/s/naughty-chatterjee-kr3bsc |
|
Eg.
Edit: formating