{"id":24021068,"url":"https://github.com/zipcodecore/parensymmetry","last_synced_at":"2025-10-07T16:49:53.046Z","repository":{"id":222546518,"uuid":"757697849","full_name":"ZipCodeCore/ParenSymmetry","owner":"ZipCodeCore","description":"balance is found except when it's not","archived":false,"fork":false,"pushed_at":"2025-06-10T19:20:18.000Z","size":22,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-06-10T20:36:23.520Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/ZipCodeCore.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-02-14T19:44:36.000Z","updated_at":"2025-06-10T19:20:22.000Z","dependencies_parsed_at":"2024-02-14T21:31:34.965Z","dependency_job_id":"a07fe6db-b257-4e7d-9ddd-31992f01aa63","html_url":"https://github.com/ZipCodeCore/ParenSymmetry","commit_stats":null,"previous_names":["zipcodecore/parensymmetry"],"tags_count":0,"template":true,"template_full_name":null,"purl":"pkg:github/ZipCodeCore/ParenSymmetry","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FParenSymmetry","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FParenSymmetry/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FParenSymmetry/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FParenSymmetry/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ZipCodeCore","download_url":"https://codeload.github.com/ZipCodeCore/ParenSymmetry/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FParenSymmetry/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":278811833,"owners_count":26050181,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-07T02:00:06.786Z","response_time":59,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":[],"created_at":"2025-01-08T12:38:23.980Z","updated_at":"2025-10-07T16:49:53.041Z","avatar_url":"https://github.com/ZipCodeCore.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ParenSymmetry Lab\n\n## Overview\n\nThis lab teaches you to implement a **balanced parentheses checker**, a fundamental algorithm used in programming language processing. You'll learn to determine whether parentheses `()` in a string are properly balanced - meaning every opening parenthesis has a corresponding closing parenthesis in the correct order.\n\n## Why This Matters: Lexing and Parsing\n\nChecking balanced delimiters is a core component of how programming languages are processed by computers. This involves two key steps:\n\n### Lexing (Lexical Analysis)\n**Lexing** is the process of breaking source code into meaningful pieces called \"tokens.\" Think of it like breaking a sentence into individual words. A lexer scans through your code character by character and groups them into tokens like keywords (`if`, `while`), operators (`+`, `-`), identifiers (variable names), and delimiters (`()`, `{}`, `[]`).\n\nFor example, the code `if (x \u003e 5)` would be tokenized as:\n- `if` (keyword)\n- `(` (opening delimiter)  \n- `x` (identifier)\n- `\u003e` (operator)\n- `5` (number)\n- `)` (closing delimiter)\n\n### Parsing (Syntax Analysis)\n**Parsing** takes the tokens from lexing and builds a structure that represents the program's syntax - like creating a sentence diagram. The parser needs to verify that delimiters are properly balanced to ensure the code structure makes sense.\n\nConsider this code:\n```\nif (condition) {\n    print(\"hello\")\n}\n```\n\nThe parser must verify that:\n- The `(` after `if` has a matching `)`\n- The opening `{` has a matching `}`\n- They're nested correctly\n\n## Real-World Applications\n\nBalanced delimiter checking is used in:\n- **Code editors** - highlighting matching brackets as you type\n- **Compilers** - validating program structure before translation\n- **IDEs** - providing syntax error detection\n- **Mathematical expressions** - ensuring formulas are correctly formed\n\n## Lab Structure\n\n- `java/` - Java implementation with Maven build system\n- `python/` - Python implementation with unittest framework\n\nBoth versions include the same core challenge: implement the `isBalanced()` method to correctly identify balanced parentheses in strings.\n\n## Getting Started\n\nChoose your preferred language directory and follow the README instructions to implement and test your solution. Remember: this simple algorithm is the foundation for understanding how programming languages are processed!","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzipcodecore%2Fparensymmetry","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzipcodecore%2Fparensymmetry","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzipcodecore%2Fparensymmetry/lists"}