{"id":6538,"date":"2026-03-14T10:42:58","date_gmt":"2026-03-14T05:12:58","guid":{"rendered":"https:\/\/study.madeeasy.in\/?p=6538"},"modified":"2026-03-30T16:46:34","modified_gmt":"2026-03-30T11:16:34","slug":"regular-expressions","status":"publish","type":"post","link":"https:\/\/www.madeeasy.in\/study\/cs-it\/regular-expressions","title":{"rendered":"Regular Expressions"},"content":{"rendered":"<h2 style=\"text-align: center;\">Regular Expression in Compiler Design<\/h2>\n<p>One day of describing regular language of via the notation of regular expressions. This notation involves<br \/>\na combination of strings of symbols from some alphabet \u2211, parentheses, and the operators +, \u22c5, and *.<\/p>\n<p>Formal definition: Let \u2211 be a given alphabet. Then<\/p>\n<ol>\n<li>\u03c6, \u03bb and a \u2208 \u2211 are all regular expressions these are called primitive regular expressions.<\/li>\n<li>If r1 and r2 are regular expressions, so are r1 + r2, r1 \u22c5 r2, r1* and (r1).<\/li>\n<li>A string is a regular expression if and only if it can be derived from the primitive regular expressions by a finite number of applications of the reuse in 92).<\/li>\n<\/ol>\n<p><strong>Operators of Regular Expressions:<\/strong><\/p>\n<ul>\n<li>R* is kleene closure of regular expression R. (* is a unary operator)<\/li>\n<li>R+ is positive closure of regular expression R. (+ is a unary operator)<\/li>\n<li>\u22c5 is concatenation operator. (\u22c5 is a binary operator)<\/li>\n<li>+ is or operator. (+ is a binary operator)<\/li>\n<\/ul>\n<p style=\"text-align: center;\"><a class=\"btn btn-danger\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/deterministic-finite-automata-dfa\" target=\"_blank\" rel=\"noopener\">&lt;&lt; Previous<\/a> | <a class=\"btn btn-success\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/context-free-grammar\" target=\"_blank\" rel=\"noopener\"> Next &gt;&gt;<\/a><br \/>\n<strong> Must Read: <\/strong> <a href=\"https:\/\/study.madeeasy.in\/cs-it\/what-is-theory-of-computation\" target=\"_blank\" rel=\"noopener\"><strong>What is Theory of Computation?<\/strong><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Regular Expression in Compiler Design One day of describing regular language of via the notation of regular expressions. This notation<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,1930],"tags":[1939,1938],"class_list":["post-6538","post","type-post","status-publish","format-standard","hentry","category-cs-it","category-computation","tag-operators-of-regular-expressions","tag-regular-expressions"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6538","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=6538"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6538\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=6538"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=6538"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=6538"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}