mua.go 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238
  1. package main
  2. import (
  3. "bufio"
  4. "fmt"
  5. "math/rand"
  6. "os"
  7. "strings"
  8. "time"
  9. )
  10. var reserved = map[string]int{
  11. "make": 2, "thing": 1, "print": 1, "read": 0, "add": 2,
  12. "sub": 2, "mul": 2, "div": 2, "mod": 2, "erase": 1,
  13. "isname": 1, "run": 1, "eq": 2, "gt": 2, "lt": 2,
  14. "and": 2, "or": 2, "not": 1, "if": 3, "isnumber": 1,
  15. "isword": 1, "islist": 1, "isbool": 1, "isempty": 1, "return": 1,
  16. "export": 1, "readlist": 0, "word": 2, "sentence": 2, "list": 2,
  17. "join": 2, "first": 1, "last": 1, "butfirst": 1, "butlast": 1,
  18. "random": 1, "int": 1, "sqrt": 1, "save": 1, "load": 1,
  19. "erall": 0, "poall": 0}
  20. type environ map[string]value
  21. type value struct {
  22. tp int
  23. num float64
  24. word string
  25. list []string
  26. split []string
  27. param []string
  28. body []string
  29. env environ
  30. b bool
  31. }
  32. func interpret(scanner *scanProvider, envs []environ) (val value, returned bool) {
  33. stack, returned := []value{}, false
  34. for !returned && scanner.Scan() {
  35. // for _, v := range stack {
  36. // fmt.Println(toString(v))
  37. // }
  38. // fmt.Println()
  39. // fmt.Println(envs[0])
  40. // fmt.Println()
  41. s := scanner.Text()
  42. if s == "\n" {
  43. continue
  44. }
  45. if s[0] == ':' {
  46. leading := len(s) - len(strings.TrimLeft(s, ":"))
  47. val := toValue(value{word: `"` + s[leading:]}, envs[0])
  48. for i := 0; i < leading; i++ {
  49. val = toValue(opThing(val, envs), envs[0])
  50. }
  51. stack = append(stack, val)
  52. } else if s[0] == '[' {
  53. list, bracketCnt := []string{}, 0
  54. for {
  55. leading := len(s) - len(strings.TrimLeft(s, "["))
  56. trailing := len(s) - len(strings.TrimRight(s, "]"))
  57. escape := len(s) - len(strings.TrimRight(strings.TrimRight(s, "]"), `\`)) - trailing
  58. trailing -= escape & 1
  59. s = s[leading : len(s)-trailing]
  60. for i := 0; i < leading; i++ {
  61. list = append(list, "[")
  62. }
  63. if s != "" {
  64. list = append(list, s)
  65. }
  66. for i := 0; i < trailing; i++ {
  67. list = append(list, "]")
  68. }
  69. bracketCnt += leading - trailing
  70. if bracketCnt < 0 {
  71. panic(fmt.Errorf("list: %s", errUnmatchedBracket))
  72. }
  73. if bracketCnt == 0 {
  74. break
  75. }
  76. s = "\n"
  77. for s == "\n" && scanner.Scan() {
  78. s = scanner.Text()
  79. }
  80. if s == "\n" {
  81. panic(fmt.Errorf("list: %s", errUnmatchedBracket))
  82. }
  83. }
  84. stack = append(stack, value{word: strings.Join(list, " ")})
  85. } else {
  86. stack = append(stack, value{word: s})
  87. }
  88. for !returned {
  89. updated := false
  90. for i := len(stack) - 1; i >= 0; i-- {
  91. if !isName(value{word: `"` + stack[i].word}) {
  92. continue
  93. }
  94. paramCnt, ok := reserved[stack[i].word]
  95. if ok {
  96. if paramCnt > len(stack)-1-i {
  97. break
  98. }
  99. for j := i + 1; j < len(stack); j++ {
  100. stack[j] = toValue(stack[j], envs[0])
  101. }
  102. switch stack[i].word {
  103. case "make":
  104. stack[i] = opMake(stack[i+1], stack[i+2], envs)
  105. case "thing":
  106. stack[i] = opThing(stack[i+1], envs)
  107. case "print":
  108. stack[i] = opPrint(stack[i+1])
  109. case "read":
  110. stack[i] = opRead(scanner)
  111. case "add":
  112. stack[i] = opAdd(stack[i+1], stack[i+2])
  113. case "sub":
  114. stack[i] = opSub(stack[i+1], stack[i+2])
  115. case "mul":
  116. stack[i] = opMul(stack[i+1], stack[i+2])
  117. case "div":
  118. stack[i] = opDiv(stack[i+1], stack[i+2])
  119. case "mod":
  120. stack[i] = opMod(stack[i+1], stack[i+2])
  121. case "erase":
  122. stack[i] = opErase(stack[i+1], envs)
  123. case "isname":
  124. stack[i] = opIsName(stack[i+1])
  125. case "run":
  126. stack[i], returned = opRun(stack[i+1], envs)
  127. case "eq":
  128. stack[i] = opEq(stack[i+1], stack[i+2])
  129. case "gt":
  130. stack[i] = opGt(stack[i+1], stack[i+2])
  131. case "lt":
  132. stack[i] = opLt(stack[i+1], stack[i+2])
  133. case "and":
  134. stack[i] = opAnd(stack[i+1], stack[i+2])
  135. case "or":
  136. stack[i] = opOr(stack[i+1], stack[i+2])
  137. case "not":
  138. stack[i] = opNot(stack[i+1])
  139. case "if":
  140. stack[i], returned = opIf(stack[i+1], stack[i+2], stack[i+3], envs)
  141. case "isnumber":
  142. stack[i] = opIsNumber(stack[i+1])
  143. case "isword":
  144. stack[i] = opIsWord(stack[i+1])
  145. case "islist":
  146. stack[i] = opIsList(stack[i+1])
  147. case "isbool":
  148. stack[i] = opIsBool(stack[i+1])
  149. case "isempty":
  150. stack[i] = opIsEmpty(stack[i+1])
  151. case "return":
  152. stack[i], returned = stack[i+1], true
  153. case "export":
  154. stack[i] = opExport(stack[i+1], envs)
  155. case "readlist":
  156. stack[i] = opReadList(scanner)
  157. case "word":
  158. stack[i] = opWord(stack[i+1], stack[i+2])
  159. case "sentence":
  160. stack[i] = opSentence(stack[i+1], stack[i+2])
  161. case "list":
  162. stack[i] = opList(stack[i+1], stack[i+2])
  163. case "join":
  164. stack[i] = opJoin(stack[i+1], stack[i+2])
  165. case "first":
  166. stack[i] = opFirst(stack[i+1])
  167. case "last":
  168. stack[i] = opLast(stack[i+1])
  169. case "butfirst":
  170. stack[i] = opButFirst(stack[i+1])
  171. case "butlast":
  172. stack[i] = opButLast(stack[i+1])
  173. case "random":
  174. stack[i] = opRandom(stack[i+1])
  175. case "int":
  176. stack[i] = opInt(stack[i+1])
  177. case "sqrt":
  178. stack[i] = opSqrt(stack[i+1])
  179. case "save":
  180. stack[i] = opSave(stack[i+1], envs[0])
  181. case "load":
  182. stack[i] = opLoad(stack[i+1], envs[0])
  183. case "erall":
  184. stack[i] = opErAll(envs[0])
  185. case "poall":
  186. stack[i] = opPoAll(envs[0])
  187. }
  188. stack = stack[:i+1]
  189. updated = true
  190. }
  191. val, _ := getValue(`"`+stack[i].word, envs)
  192. if val.param != nil {
  193. if len(val.param) > len(stack)-1-i {
  194. break
  195. }
  196. for j := i + 1; j < len(stack); j++ {
  197. stack[j] = toValue(stack[j], envs[0])
  198. }
  199. local := environ{stack[i].word: val}
  200. for j, name := range val.param {
  201. local[name] = stack[i+1+j]
  202. }
  203. stack[i], _ = opRun(value{tp: typeList, split: val.body}, []environ{local, val.env, envs[2]})
  204. stack = stack[:i+1]
  205. updated = true
  206. }
  207. }
  208. if !updated {
  209. break
  210. }
  211. }
  212. }
  213. if len(stack) == 0 {
  214. val = value{tp: typeList, list: []string{}, split: []string{"[", "]"}}
  215. return
  216. }
  217. val = toValue(stack[len(stack)-1], envs[0])
  218. return
  219. }
  220. func main() {
  221. rand.Seed(time.Now().UnixNano())
  222. env := map[string]value{"pi": {tp: typeNumber, num: 3.14159}}
  223. if len(os.Args) > 1 {
  224. file, err := os.Open(os.Args[1])
  225. if err != nil {
  226. panic(fmt.Errorf("script: %s (%s)", errFileError, os.Args[1]))
  227. }
  228. os.Stdin = file
  229. }
  230. scanner := bufio.NewScanner(os.Stdin)
  231. scanner.Split(splitFunc)
  232. interpret(&scanProvider{isList: false, scanner: scanner}, []environ{env, nil, env})
  233. }