BACKENDΒ·μ€‘μš”λ„ 6Β·2026. 06. 23.Β·Dev.to

How I built my own Turing-complete programming language engine from scratch using Go πŸš€

── KO ──────────────────

Go둜 λ§Œλ“  Turing μ™„μ „ν•œ ν”„λ‘œκ·Έλž˜λ° μ–Έμ–΄ μ—”μ§„ Pampa μ†Œκ°œ.

PampaλŠ” Go둜 μž‘μ„±λœ λ„€μ΄ν‹°λΈŒ, μ»€μŠ€ν…€ 인터프리터 ν”„λ‘œκ·Έλž˜λ° μ–Έμ–΄λ‘œ, μ™ΈλΆ€ 쒅속성이 μ „ν˜€ μ—†μŠ΅λ‹ˆλ‹€. 이 ν”„λ‘œμ νŠΈλŠ” μƒνƒœ 관리, AST 평가, λ©”λͺ¨λ¦¬ λ§€ν•‘ 등을 직접 닀루며 μ½”λ“œμ˜ λ™μž‘μ„ 깊이 이해할 수 있게 ν•΄μ€λ‹ˆλ‹€. PampaλŠ” μ„ ν˜• μ‚°μˆ , λ³€μˆ˜ 바인딩, 쑰건문 및 루프 싀행을 μ§€μ›ν•˜μ—¬ Turing 완전성을 κ°€μ§‘λ‹ˆλ‹€. 이 엔진은 μ˜€ν”ˆ μ†ŒμŠ€λ‘œ 배포되며, ν΄λ‘ ν•˜μ—¬ μ‚¬μš©ν•΄λ³Ό 수 μžˆμŠ΅λ‹ˆλ‹€.


── EN ──────────────────

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.

원문 보기 β†’λͺ©λ‘μœΌλ‘œ