Re:Show HN: How to write a recursive descent parser
by breatheoften on Monday March 20, 2017 @02:00PM
(#13916250)
Are there any statically typed S-expression languages?
[ Parent
| on HN ]
Re:Show HN: How to write a recursive descent parser
by glenda on Monday March 20, 2017 @02:08PM
(#13916314)
Typed Racket is the only one I've come across but I'm sure there are a few more.
Re:Show HN: How to write a recursive descent parser
by munificent on Monday March 20, 2017 @03:17PM
(#13916870)
Shen is another one:
There are also a ton of hobby languages that are statically typed and use s-exprs so the author doesn't have to spend as much time on syntax.
Re:Show HN: How to write a recursive descent parser
by shanemhansen on Monday March 20, 2017 @04:25PM
(#13917375)
Clojure does allow type annotations that are used to avoid reflection. https://clojure.org/reference/java_interop#Java%20Interop-Ty...
(defn len2 [^String x]
(.length x))