-2^2 (infix符号)应该转换为-2 2 ^ (后缀符号)。但是,在评估后缀时,它会像预期的那样,计算为4,而不是-4,这是预期的结果。
我正在使用Lua,下面是我的优先级和结合度表:
-- Precedence table for different operators
local PRECEDENCE = {
[Token.Type.MINUS] = 0,
[Token.Type.PLUS] = 0,
[Token.Type.ASTERIK] = 1,
[Token.Type.SLASH] = 1,
[Token.Type.CARET] = 2,
[Token.Type.UMINUS] = 3
}
-- Associativity table for different operators
-- 0 = LTR (Left To Right)
-- 1 = RTL (Right To Left)
local ASSOCIATIVITY = {
[Token.Type.MINUS] = 0,
[Token.Type.PLUS] = 0,
[Token.Type.ASTERIK] = 0,
[Token.Type.SLASH] = 0,
[Token.Type.CARET] = 1,
[Token.Type.UMINUS] = 1
}当试图计算-2^2时,输出队列如下所示:
{
2,
UMINUS,
2,
CARET
}这是我的解析器。值得注意的是,queue和stack是具有各自功能的“类”。
--[[
Parse tokens
]]
function Parser:parse()
self:preprocess() -- Convert valid MINUS tokens into UMINUS
while (self.token) do
local token = self.token
if (token.type == Token.Type.NUMBER) then
self.queue:enqueue(tonumber(token.value))
elseif (isOperator(token)) then -- PLUS, MINUS, SLASH, ASTERIK, UMINUS, CARET
while (not self.stack:isEmpty()
and ASSOCIATIVITY[token.type]
and PRECEDENCE[token.type]
and ASSOCIATIVITY[self.stack:top().type]
and PRECEDENCE[self.stack:top().type]
and ((ASSOCIATIVITY[token.type] == 0 and PRECEDENCE[token.type] <= PRECEDENCE[self.stack:top().type])
or (ASSOCIATIVITY[token.type] == 1 and PRECEDENCE[token.type] < PRECEDENCE[self.stack:top().type]))) do
self.queue:enqueue(self.stack:pop())
end
self.stack:push(token)
elseif (token.type == Token.Type.LPAREN) then
self.stack:push(token)
elseif (token.type == Token.Type.RPAREN) then
while (self.stack:top().type ~= Token.Type.LPAREN) do
self.queue:enqueue(self.stack:pop())
end
self.stack:pop()
end
self:next() -- Move to the next token
end
while (not self.stack:isEmpty()) do
self.queue:enqueue(self.stack:pop())
end
return self.queue
end我做错了什么?我尝试了一个在线计算器这里,我也得到了4,但是我知道正确的输出应该是该表达式的-4。
发布于 2021-08-24 23:01:55
要得到预期的结果,克拉必须比一元减号有更高的优先级。在Lua的运算符优先中就是这样工作的。-2^2的后缀符号实际上应该是2 2 ^ UMINUS。记住,任何实数的平方都是正数。您只需交换优先级级别:
[Token.Type.CARET] = 3,
[Token.Type.UMINUS] = 2,https://stackoverflow.com/questions/68914756
复制相似问题