{"id":17687808,"url":"https://github.com/gituser12981u2/mathematicalexpressionparser","last_synced_at":"2025-03-30T21:21:51.108Z","repository":{"id":164690085,"uuid":"581010491","full_name":"gituser12981u2/MathematicalExpressionParser","owner":"gituser12981u2","description":"This Java application is designed to parse and evaluate mathematical expressions. It utilizes a Lexer to tokenize input, a Parser to construct an abstract syntax tree (AST), and evaluates these expressions to return results in fractional form.","archived":false,"fork":false,"pushed_at":"2024-04-27T20:17:56.000Z","size":26,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-06T00:37:09.255Z","etag":null,"topics":["abstract-syntax-tree","ast","calculator","java","lexer","parser"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gituser12981u2.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":"2022-12-22T03:08:06.000Z","updated_at":"2024-06-19T05:40:13.000Z","dependencies_parsed_at":"2024-10-24T13:54:21.165Z","dependency_job_id":"18107e89-734a-4c3d-bac9-2a8002ea1788","html_url":"https://github.com/gituser12981u2/MathematicalExpressionParser","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gituser12981u2%2FMathematicalExpressionParser","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gituser12981u2%2FMathematicalExpressionParser/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gituser12981u2%2FMathematicalExpressionParser/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gituser12981u2%2FMathematicalExpressionParser/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gituser12981u2","download_url":"https://codeload.github.com/gituser12981u2/MathematicalExpressionParser/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246380315,"owners_count":20767838,"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","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":["abstract-syntax-tree","ast","calculator","java","lexer","parser"],"created_at":"2024-10-24T11:23:09.794Z","updated_at":"2025-03-30T21:21:51.087Z","avatar_url":"https://github.com/gituser12981u2.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Java Expression Parser\n\n## Project Overview\nThis Java application is designed to parse and evaluate mathematical expressions. It utilizes a Lexer to tokenize input, a Parser to construct an abstract syntax tree (AST), and evaluates these expressions to return results in fractional form.\n\n## Files Description\n- **`App.java`**: The main entry point of the application that sets up the environment and starts the parser.\n- **`ASTNode.java`**: Defines nodes for the abstract syntax tree used by the parser to represent expressions.\n- **`Fraction.java`**: Handles operations and representations of fractions to maintain accuracy in calculations.\n- **`Lexer.java`**: Responsible for breaking down the input into recognizable tokens.\n- **`Parser.java`**: Parses tokens to construct an AST based on the defined grammar of expressions.\n- **`Token.java`**: Represents a token object with a specific type and value.\n- **`TokenType.java`**: Enumerates possible types of tokens that can be recognized by the lexer.\n\n## Setup and Running\nTo run this project, ensure you have Java installed on your machine.\n\n1. **Compile the project:**\n   ```bash\n   javac App.java\n   ```\n\n2. **Run the application:**\n    ```bash\n    java App\n    ```\n\n## Contributing\nContributions to this project are welcome. Please adhere to the following steps for contributions:\n\n1. Fork the repository.\n2. Create a new branch for your feature.\n3. Add your contributions.\n4. Submit a pull request.\n\n## License\nThis project is relased under the GLU 3.0 License. Details can be fount in the '[LICENSE](LICENSE)' file. \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgituser12981u2%2Fmathematicalexpressionparser","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgituser12981u2%2Fmathematicalexpressionparser","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgituser12981u2%2Fmathematicalexpressionparser/lists"}