3
            
            votes
        
        
            
            
        S-expression parser in Rust
                    Your questions
Is there a nice way to compile that regex once and store it somewhere?
Yep, OnceLock:
...
                
            
       
        
            
                3
            
            votes
        
        
        Operator-precedence calculator in C
                    Strongly consider using braces consistently. In reduce notably you have an if without curly braces, and then curly braces around ...
                
            
       
        
            
                2
            
            votes
        
        
            
        Lisp expression parser
                    Let's avoid some repetition by defining a list of sample cases and then looping over that.
...
                
            
       
        
            
                1
            
            vote
        
        
        Lisp expression parser
                    Overview
The code layout is good, and you used meaningful names for many of the
functions and variables. Well done.   Here are some minor coding style suggestions.
Documentation
It's great that your ...
                
            
       
        
            
                1
            
            vote
        
        
        Infix epression evaluation
                    Notes
You've used the ;; token extensively in your code. A well-formed OCaml program has no need for this, as it is composed only of top-level bindings/definitions, ...
                
            
       
        Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
parsing × 1361python × 323
c++ × 180
java × 179
c# × 156
c × 134
performance × 133
strings × 133
beginner × 115
javascript × 96
python-3.x × 87
regex × 78
xml × 67
json × 60
csv × 54
php × 48
haskell × 47
math-expression-eval × 47
object-oriented × 42
file × 40
html × 38
algorithm × 36
reinventing-the-wheel × 36
rust × 36
datetime × 32
