{"id":22671245,"url":"https://github.com/abhayvashokan/compiler-design-lab","last_synced_at":"2025-03-29T11:42:35.595Z","repository":{"id":56412693,"uuid":"288716899","full_name":"AbhayVAshokan/Compiler-Design-Lab","owner":"AbhayVAshokan","description":"Compiler Design Lab KTU 2020","archived":false,"fork":false,"pushed_at":"2021-01-15T12:17:04.000Z","size":5462,"stargazers_count":2,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-04T11:51:46.483Z","etag":null,"topics":["c","compiler-design","ktu","lex","yacc"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AbhayVAshokan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-08-19T11:45:55.000Z","updated_at":"2023-11-16T01:42:33.000Z","dependencies_parsed_at":"2022-08-15T18:10:53.204Z","dependency_job_id":null,"html_url":"https://github.com/AbhayVAshokan/Compiler-Design-Lab","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/AbhayVAshokan%2FCompiler-Design-Lab","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbhayVAshokan%2FCompiler-Design-Lab/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbhayVAshokan%2FCompiler-Design-Lab/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbhayVAshokan%2FCompiler-Design-Lab/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AbhayVAshokan","download_url":"https://codeload.github.com/AbhayVAshokan/Compiler-Design-Lab/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246180891,"owners_count":20736459,"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":["c","compiler-design","ktu","lex","yacc"],"created_at":"2024-12-09T16:14:01.229Z","updated_at":"2025-03-29T11:42:35.148Z","avatar_url":"https://github.com/AbhayVAshokan.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Compiler Design Lab\n\n### List of Experiments\n\n\u003col\u003e\n  \u003cli\u003e Design and implement a lexical analyzer for given language using C. The lexical analyzer should ignore redundant spaces, tabs and newlines. \u003c/li\u003e   \n  \u003cli\u003eImplementation of Lexical Analyzer using Lex Tool.\u003c/li\u003e\n  \u003cli\u003eGenerate YACC specification for a few syntactic categories.\u003c/li\u003e      \n    \u003col style=\"list-style-type:lower-alpha\"\u003e\n      \u003cli\u003eProgram to recognize a valid arithmetic expression that uses operator +, –, * and /.\u003c/li\u003e\n      \u003cli\u003eImplementation of Calculator using LEX and YACC.\u003c/li\u003e\n      \u003cli\u003eConvert the BNF rules into YACC form and write code to generate abstract syntax tree.\u003c/li\u003e\n    \u003c/ol\u003e\n  \u003cli\u003eWrite program to find ε – closure of all states of any given NFA with ε transition\u003c/li\u003e\n  \u003cli\u003eWrite program to convert NFA with ε transition to NFA without ε transition.\u003c/li\u003e\n  \u003cli\u003eWrite program to convert NFA to DFA.\u003c/li\u003e\n  \u003cli\u003eWrite program to minimize any given DFA.\u003c/li\u003e\n  \u003cli\u003eDevelop an operator precedence parser for a given language.\u003c/li\u003e\n  \u003cli\u003eWrite program to Simulate First and Follow of any given grammar.\u003c/li\u003e\n  \u003cli\u003eConstruct a recursive descent parser for an expression.\u003c/li\u003e\n  \u003cli\u003eConstruct a Shift Reduce Parser for a given language.\u003c/li\u003e\n  \u003cli\u003eWrite a program to perform loop unrolling.\u003c/li\u003e\n  \u003cli\u003eWrite a program to perform constant propagation.\u003c/li\u003e\n  \u003cli\u003eImplement Intermediate code generation for simple expressions.\u003c/li\u003e\n  \u003cli\u003eImplement the back end of the compiler which takes the three address code and produces the 8086 assembly language instructions that can be assembled and run using an 8086 assembler. The target assembly instructions can be simple move, add, sub, jump etc.\u003c/li\u003e\n\u003c/ol\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhayvashokan%2Fcompiler-design-lab","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabhayvashokan%2Fcompiler-design-lab","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhayvashokan%2Fcompiler-design-lab/lists"}