- Viewed 846 times
1
edited Oct 2, 2018 at 6:50This can get really complex quite fast. Consider (1 - 2 * 3). If your calculator only supports addition and negation, this is still not trivial. Consider (5 - 5 - 5). If you consider the input as left associative, you'll get the correct -5, but if you read it as right associative (which is a common mistake if you parse the expression with some LL parser), you'll get 0.
In order to transform from infix to prefix (which is how you'll calculate your result in Scheme) correctly, you'll usually want to parse the entire input into a parse tree, and o...
Content Under CC-BY-SA license - Question & Answer
Define a scheme function for infix - Stack Overflow
網頁In order to transform from infix to prefix (which is how you'll calculate your result in Scheme) correctly, you'll usually want to parse the entire input into a parse tree, and once that's …
scheme - Arithmetic calculation using infix notation - Stack Overflow
網頁If you want to use infix syntax there are several options. You could use #lang sweet-exp and write {{3 * 6} + 5}, or you could use (require infix) and write @${(3 * 6) + 5}, or you could …
SCHEME: How to evaluate an arithmetical expression
網頁In scheme - how can I evaluate a simple expression (containing only + * - / and 0-9 digits) given as a string? I've tried to first turn the expression into a postfix expression but I …
How to evaluate an infix expression in just one scan using stacks?
網頁I want to know if there is a way to solve infix expressions in a single pass using 2 stacks? The stacks can be one for operator and the other for operands... The standard way to …
interpreter - Evaluation in Scheme - Stack Overflow
網頁You would need to substitute the given values of var1, var2, and var3 into the expression, and then evaluate the expression. Your function will probably be given the environment …
- 其他人也問了以下問題
Infix to Prefix conversion scheme - Stack Overflow
網頁I'm trying to figure out how to convert an infix expression to prefix in Scheme. I found this post which does what I want but in the opposite direction. What changes when going …
Scheme Lisp - Using eval for arbitrary arithmetic expressions
網頁I'm trying to evaluate arbitrary and nested arithmetic expressions in scheme with eval. The expressions are build up from numbers, operators, constant bindings and parentheses. …
stack - Evaluating an infix expression python - Stack Overflow
網頁Here are the step by step directions for how to evaluate the infix expression: Just scan the expression from left to right. If it is anything other than a ), push it onto the stack. When …
Operator precedence prefix conversion - Scheme - Stack Overflow
網頁I am writing a function that takes a quoted arithmetic infix expression involving numbers, variables, and operators and converts it to prefix notation. For example: (infix->prefix '(2 …
What is easiest way to calculate an infix expression using C …
網頁6 Answers. Sorted by: 6. C doesn't have an "eval" function built-in, but there are libraries that provide it. I would highly recommend using TinyExpr. It's free and open-source C code …
跳至內容