最終更新日：2024/08/06

(computing theory) A method for parsing mathematical expressions specified in infix notation.

正解を見る

shunting-yard algorithm

問題を編集する

元となった辞書の項目

shunting-yard algorithm

name

(computing theory) A method for parsing mathematical expressions specified in infix notation.

The shunting-yard algorithm is used to convert infix expressions to postfix expressions.

意味（1）

(computing theory) A method for parsing mathematical expressions specified in infix notation.