-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.kt
More file actions
149 lines (127 loc) · 3.74 KB
/
main.kt
File metadata and controls
149 lines (127 loc) · 3.74 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
// Stack functions: I'd rather like to use push pop and peek in a stack
fun <T> ArrayDeque<T>.push(item: T) {
this.addLast(item)
}
fun <T> ArrayDeque<T>.pop(): T? {
if (this.isEmpty()) {
return null
}
return this.removeLast()
}
fun <T> ArrayDeque<T>.peek(): T? {
if (this.isEmpty()) {
return null
}
return this.last()
}
// Tokenizer
sealed class Token
data class NumberToken(val value: Double) : Token()
data class OperatorToken(val operator: String) : Token()
data class InvalidToken(val value: String) : Token()
fun tokenize(input: String): List<Token> {
val tokens = mutableListOf<Token>()
val tokenPatterns = """([-]*\d+(\.\d+)?)|([+\-*/]|sqr)""".toRegex()
val matches = tokenPatterns.findAll(input)
for (match in matches) {
val (number, _, operator) = match.destructured
when {
number.isNotEmpty() -> tokens.add(NumberToken(number.toDouble()))
operator.isNotEmpty() -> tokens.add(OperatorToken(operator))
else -> tokens.add(InvalidToken(match.value))
}
}
return tokens
}
// Operator Definitions
sealed class Operator {
abstract fun apply(stack: ArrayDeque<Double>)
}
object Add : Operator() {
override fun apply(stack: ArrayDeque<Double>) {
if (stack.size >= 2) {
val right = stack.pop() ?: 0.0
val left = stack.pop() ?: 0.0
stack.push(left + right)
} else println("Stack error.")
}
}
object Sub : Operator() {
override fun apply(stack: ArrayDeque<Double>) {
if (stack.size >= 2) {
val right = stack.pop() ?: 0.0
val left = stack.pop() ?: 0.0
stack.push(left - right)
} else println("Stack error.")
}
}
object Mul : Operator() {
override fun apply(stack: ArrayDeque<Double>) {
if (stack.size >= 2) {
val right = stack.pop() ?: 0.0
val left = stack.pop() ?: 0.0
stack.push(left * right)
} else println("Stack error.")
}
}
object Div : Operator() {
override fun apply(stack: ArrayDeque<Double>) {
if (stack.size >= 2) {
val right = stack.pop() ?: 0.0
val left = stack.pop() ?: 0.0
if (right != 0.0) stack.push(left / right) else println("Division by zero error.")
} else println("Stack error.")
}
}
object Sqr : Operator() {
override fun apply(stack: ArrayDeque<Double>) {
if (stack.size >= 1) {
val operand = stack.pop() ?: 0.0
stack.push(operand * operand)
} else println("Stack error.")
}
}
object Nop : Operator() {
override fun apply(stack: ArrayDeque<Double>) {
// nothing
}
}
fun operatorFromString(opCode: String): Operator {
when (opCode) {
"+" -> return Add
"-" -> return Sub
"*" -> return Mul
"/" -> return Div
"sqr" -> return Sqr
}
return Nop
}
class RPNCalculator {
private val stack = ArrayDeque<Double>()
fun evaluateInput(input: String): String {
val tokens = tokenize(input)
tokens.forEach { token ->
when (token) {
is NumberToken -> stack.push(token.value)
is OperatorToken -> operatorFromString(token.operator).apply(stack)
is InvalidToken -> {}
}
}
return stack.peek().toString()
}
}
fun main(args: Array<String>) {
if (args.isEmpty().not()) {
println("Arguments not supported yet.")
}
val calculator = RPNCalculator()
while (true) {
print("Input>")
val input = readlnOrNull()
if (input == "exit") {
println("Exit.")
break
}
if (input != null) println(calculator.evaluateInput(input))
}
}