- Note: This article contains special characters.
Many of the Aheui's concept is derived from Befunge-93, except the fact that it has no instruction for self-modifying, and that it has 26 stacks and one queue.
- This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by .
Unlike Befunge-93, Aheui does not specify limit of codespace; however, Aheui does not use codespace as a storage. Aheui has additional stacks instead. Since a pair of unbounded stacks can be used to simulate the unbounded tape of a Turing machine, it is likely that Aheui is Turing-complete. Partial proof.
This code prints "Hello, world!":
밤밣따빠밣밟따뿌 빠맣파빨받밤뚜뭏 돋밬탕빠맣붏두붇 볻뫃박발뚷투뭏붖 뫃도뫃희멓뭏뭏붘 뫃봌토범더벌뿌뚜 뽑뽀멓멓더벓뻐뚠 뽀덩벐멓뻐덕더벅
Times table generator
This code is for Project Euler's Problem 1. It may still need reduction.
바싹밣발발발따따뚜 루벌루벋뻐터너벌벌 우뽀처빠쑥사빠아초희멍 처아아오삭도오어샥여오여
This program may need reduction.
바싹바발발나빠뱐주뱔뗘땨뼈뺘뗘뺘변따뗘 삭망희ㅇ루벅포뼈차 싹샥뼈댜챠사빠쑥 ㅇㅇㅇㅇ쌰석쇼뎌
발발나싹발밤따뿌망희 뿌석뻐서썬뻐석처속 사싹샥도루발나툐 빠쌱션속쳐볼서
바싹밤발발따뚜 투너벌벌뻐뻐뻐 따따싹삭두빠초 뭉뱔벌냐셔토삭 희
This article contains special characters that fall in the Hangul Syllable area of the Unicode charset. You need an appropriate font for the browser to display it correctly. Because Aheui is a two-dimensional language, using a monospacial Hangul font is highly recommended. (e.g. UnDotum)