How I built my own Turing-complete programming language engine from scratch using Go π
Goλ‘ λ§λ Turing μμ ν νλ‘κ·Έλλ° μΈμ΄ μμ§ Pampa μκ°.
Pampaλ Goλ‘ μμ±λ λ€μ΄ν°λΈ, 컀μ€ν μΈν°νλ¦¬ν° νλ‘κ·Έλλ° μΈμ΄λ‘, μΈλΆ μ’ μμ±μ΄ μ ν μμ΅λλ€. μ΄ νλ‘μ νΈλ μν κ΄λ¦¬, AST νκ°, λ©λͺ¨λ¦¬ λ§€ν λ±μ μ§μ λ€λ£¨λ©° μ½λμ λμμ κΉμ΄ μ΄ν΄ν μ μκ² ν΄μ€λλ€. Pampaλ μ ν μ°μ , λ³μ λ°μΈλ©, 쑰건문 λ° λ£¨ν μ€νμ μ§μνμ¬ Turing μμ μ±μ κ°μ§λλ€. μ΄ μμ§μ μ€ν μμ€λ‘ λ°°ν¬λλ©°, ν΄λ‘ νμ¬ μ¬μ©ν΄λ³Ό μ μμ΅λλ€.
Introducing Pampa, a Turing-complete programming language engine built in Go.
Pampa is a native, custom interpreted programming language entirely written in Go with no external dependencies. The project delves into state management, AST evaluation, and memory mapping, enhancing the understanding of language mechanics. It supports standard linear arithmetic, variable bindings, conditionals, and loop execution, making it Turing-complete. The engine is fully open-source and available for cloning and experimenting.