{"id":40088562,"url":"https://github.com/ryanwebber/gillian","last_synced_at":"2026-01-19T10:01:25.561Z","repository":{"id":249916247,"uuid":"769836002","full_name":"ryanwebber/gillian","owner":"ryanwebber","description":"A stack-based code golfing language","archived":false,"fork":false,"pushed_at":"2024-03-10T20:57:47.000Z","size":15,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-07-24T05:44:59.762Z","etag":null,"topics":["code-golf","programming-language"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ryanwebber.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-03-10T07:38:27.000Z","updated_at":"2024-07-24T05:45:03.347Z","dependencies_parsed_at":"2024-07-24T05:55:04.992Z","dependency_job_id":null,"html_url":"https://github.com/ryanwebber/gillian","commit_stats":null,"previous_names":["ryanwebber/gillian"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ryanwebber/gillian","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ryanwebber%2Fgillian","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ryanwebber%2Fgillian/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ryanwebber%2Fgillian/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ryanwebber%2Fgillian/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ryanwebber","download_url":"https://codeload.github.com/ryanwebber/gillian/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ryanwebber%2Fgillian/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28565052,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-19T08:53:44.001Z","status":"ssl_error","status_checked_at":"2026-01-19T08:52:40.245Z","response_time":67,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["code-golf","programming-language"],"created_at":"2026-01-19T10:01:25.388Z","updated_at":"2026-01-19T10:01:25.548Z","avatar_url":"https://github.com/ryanwebber.png","language":"Rust","readme":"# Gillian\nA stack-based code golfing language.\n\n## Getting Started\n```bash\n# Building the project\ncargo build --release\n\n# Print the first 100 fibinacci numbers\necho 'p1pC{2P+' | ./target/release/gillian\n#  p: Duplicate the top value on the stack. The stack is empty, so a 0 is pushed instead. The stack now contains [0].\n#  1: Push the number 1 to the stack. The stack now contains [0, 1].\n#  p: Duplicate the top value on the stack. The stack now contains [0, 1, 1].\n#  C: Multiply the top value on the stack by 100. The stack now contains [0, 1, 100].\n#  {: Pop 100 off the stack. Run the following block (implicitly terminated by EOF) 100 times.\n#      2: Push the number 2 to the stack.\n#      P: Pop 2 off the stack. Duplicate the top 2 values on the stack. The stack now contains [0, 1, 0, 1].\n#      +: Pop the top 2 values off the stack and add them. The stack now contains [0, 1, 1].\n#      ... The block repeats, copying the top 2 stack values and replacing them with their sum.\n```\n\n## Language Specification\n\nA Gillan program is a plain ASCII string of characters. The program is executed by reading the\ncharacters from left to right, and performing the corresponding operations.\n\nAs a stack-based language, most operations involve pushing and popping values from the stack.\n\n### Types\n - `Number` - A 64-bit floating point number.\n - `List` - An ordered sequence of values.\n - `String` - A sequence of characters. Also represents blocks of code.\n\n### Literals\n| Literal  | Description |\n|:--------:|-------------|\n| `[0-9]+` | Pushes the corresponding base-10 number to the stack. |\n| `\".*\"`   | Pushes the string between the quotations to the stack. Implicitly terminated by EOF. |\n\n### Range Operations\n| Operator | Description |\n|:--------:|-------------|\n| `R`      | Pops a number `n` off the stack. Constructs a range from 0 to `n`, non-exclusive, and pushes it to the stack. |\n\n\n### Unary Operators\n| Operator | Description |\n|:--------:|-------------|\n| `[IXCM]` | Multiply the value on the stack by `1`, `10`, `100`, or `1000` respectively. If the value on the stack is a list, the operation is performed element-wise. `I` is useful to terminate number literals when necessary. |\n| `p`      | Duplicates the top value on the stack and pushes it. |\n| `A`      | Pops the top value off the stack, adds `1` to it, and pushes the result. If the value is a list, the operation is performed element-wise. |\n\n\n### Binary Operators\n| Operator | Description |\n|:--------:|-------------|\n| `.`      | Pops 2 values, `A` and `B`, off the stack and pushes an array containing `B` repeated `A` times. |\n| `*`      | Pops the top 2 values off the stack and multiplies them, pushing the result to the stack. If either value is a list, the multiplication is performed cartesian-product wise. |\n| `+`      | Pops the top 2 values off the stack and adds them, pushing the result to the stack. If either value is a list, the addition is performed cartesian-product wise. |\n| `P`      | Pops a number `n` off the stack. Duplicate the top `n` values on the stack and push them in order. |\n\n### Special Operators\n| Operator | Description |\n|:--------:|-------------|\n| `E`      | Pops a string off the stack and evaluates it as source code on the existing stack. |\n| `$`      | Push the program source as a string on the stack. |\n| `#`      | Push the current loop iteration on the stack. |\n| `_`      | Push the current loop element on the stack, if iterating over a list or range. |\n| `{`      | Capture the string between `{` and the subsequent `}` (or EOF). Pop a value off the stack and iterate through it, executing the string each iteration. |\n\n### Special Behaviors\n - **Termination**: Values left on the stack at the end of the program are printed to the console separated by new\n   lines. If the only remaining value is a list, it's elements are instead printed to the console,\n   separated by new lines.\n - **Underflow**: There is no underflow. If an operation requires more values than are on the stack, the number\n   `0` is used in place of any missing values.\n - **Ranges**: When used in arithmetic operations, ranges are treated as lists containing the integers represented\n   by the range.\n - **Iteration**: Iteration over a range or list is done in the order the elements appear in the range or list. Iteration\n    over a number `n` is performed by iterating over the range `[0, n)`.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fryanwebber%2Fgillian","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fryanwebber%2Fgillian","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fryanwebber%2Fgillian/lists"}