{"id":527,"slug":"lr-parser","name":"LR parser","short_description":"LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time.","url":"https://github.com/topics/lr-parser","github_count":81,"created_by":null,"logo_url":null,"released":null,"wikipedia_url":"https://en.wikipedia.org/wiki/LR_parser","related_topics":["ll-parser"],"aliases":["lr-parsing"],"github_url":null,"content":"\u003cp\u003eIn computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time.[1] There are several variants of LR parsers: SLR parsers, LALR parsers, Canonical LR(1) parsers, Minimal LR(1) parsers, and GLR parsers. LR parsers can be generated by a parser generator from a formal grammar defining the syntax of the language to be parsed. They are widely used for the processing of computer languages.\u003c/p\u003e\n","created_at":"2024-07-29T13:47:34.242Z","updated_at":"2026-06-30T00:18:10.017Z","topic_url":"https://awesome.ecosyste.ms/api/v1/topics/lr-parser","html_url":"https://awesome.ecosyste.ms/topics/lr-parser","projects_url":"https://awesome.ecosyste.ms/api/v1/projects?keyword=lr-parser","lists_url":"https://awesome.ecosyste.ms/api/v1/lists?topic=lr-parser"}