{"id":137,"date":"2011-03-11T08:50:41","date_gmt":"2011-03-11T08:50:41","guid":{"rendered":"http:\/\/songoku.homelinux.com\/wordpress\/?p=137"},"modified":"2011-03-11T08:50:41","modified_gmt":"2011-03-11T08:50:41","slug":"regular-expression","status":"publish","type":"post","link":"https:\/\/ndk.sytes.net\/wordpress\/?p=137","title":{"rendered":"Regular expression"},"content":{"rendered":"<p>In computing, a <b>regular expression<\/b>, also referred to as <b>regex<\/b> or <b>regexp<\/b>, provides a concise and flexible means for matching strings of text, such as particular characters, words, or patterns of characters. A regular expression is written in a formal language that can be interpreted by a regular expression processor, a program that either serves as a <span class=\"mw-redirect\">parser generator<\/span> or examines text and identifies parts that match the provided specification.<\/p>\n<p>The following examples illustrate a few specifications that could be expressed in a regular expression:<\/p>\n<ul>\n<li>The sequence of characters &quot;car&quot; appearing consecutively in any context, such as in &quot;car&quot;, &quot;cartoon&quot;, or &quot;bicarbonate&quot;<\/li>\n<li>The sequence of characters &quot;car&quot; occurring in that order with other characters between them, such as in &quot;Icelander&quot; or &quot;chandler&quot;<\/li>\n<li>The word &quot;car&quot; when it appears as an isolated word<\/li>\n<li>The word &quot;car&quot; when preceded by the word &quot;blue&quot; or &quot;red&quot;<\/li>\n<li>The word &quot;car&quot; when <i>not<\/i> preceded by the word &quot;motor&quot;<\/li>\n<li>A dollar sign immediately followed by one or more digits, and then optionally a period and exactly two more digits (for example, &quot;$100&quot; or &quot;$245.99&quot;).<\/li>\n<\/ul>\n<p>Regular expressions can be much more complex than these examples.<\/p>\n<p>The rest of the article can be found on <a href=\"http:\/\/en.wikipedia.org\/wiki\/Regular_expressions\" target=\"_blank\">wikipedia<\/a> with some nice examples.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In computing, a regular expression, also referred to as regex or regexp, provides a concise and flexible means for matching strings of text, such as particular characters, words, or patterns of characters. A regular expression is written in a formal language that can be interpreted by a regular expression processor, a program that either serves [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[],"class_list":["post-137","post","type-post","status-publish","format-standard","hentry","category-programming"],"_links":{"self":[{"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/137","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=137"}],"version-history":[{"count":0,"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/137\/revisions"}],"wp:attachment":[{"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=137"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=137"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ndk.sytes.net\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=137"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}