Aplikasi Pembelajaran Ekspresi Aritmatika dengan Metode Regular Definition
Abstract
Arithmetic expressions are important programming-language constructs because they contain operands and
operators that must be processed according to syntactic rules and operator precedence. This study designs a
learning application that visualizes expression-structure validation using Regular Definition and evaluates valid
expressions using postfix notation and a stack data structure. The proposed Regular Definition describes letters,
digits, variables, and integer constants. The supported operators are addition, subtraction, multiplication,
division, and exponentiation. The application flow consists of expression input, token recognition, validation,
sub-expression decomposition, infix-to-postfix conversion, variable-value input, and step-by-step postfix
evaluation. The design results indicate that the application can display token categories, variables and constants,
postfix notation, stack-operation steps, and evaluation results. The application can therefore support visual
learning in Compiler Techniques. This study focuses on functional design and implementation; learning
effectiveness has not been measured with respondents.

