Linux_Shell正则表达式语法介绍(Linux_Shell regular expression syntax introduction).docVIP

Linux_Shell正则表达式语法介绍(Linux_Shell regular expression syntax introduction).doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Linux_Shell正则表达式语法介绍(Linux_Shell regular expression syntax introduction)

Linux_Shell正则表达式语法介绍(Linux_Shell regular expression syntax introduction) A regular expression is a text pattern consisting of regular characters (such as characters a to Z) and special characters (called meta characters). This pattern describes one or more strings to match when searching for a text body. A regular expression, as a template, matches a character pattern with the string it searches for. \ Mark the next character as a special character, or a literal character, or a backward reference, or an octal escape character. For example, thenmatches the character n. \nmatches a newline character. Sequence matching \ and \ \ \ (, (. ^ Matches the start position of the input string. $ Matches the end position of the input string. * Matches the previous sub expression zero or more times. For example, zo* can match Z and zoo. * equivalent to {0}. + Matches the previous sub expression one or more times. For example,zo+matches Zo and zoo, but does not match Z. + is equivalent to {1}. ? Matches the previous sub expression zero or twice. For example, do (ES) can match the do in do or does. Equivalent to {0,1}?. {n} N is a nonnegative integer. Match the specified n times. For example,o{2}does not match theo in Bob, but it matches the two o in food. {n} N is a nonnegative integer. Match at least n times. For example,o{2,}cannot match Bob ino, but can match all o in foooood. o{1,}is equivalent too+. o{0,}is equivalent too*. {n, m} M and N are non negative integers, n = M. Match n times at least, and match m times at most. O{1,3} will match the first three o in fooooood. o{0,1}is equivalent toO?. Note that there is no space between commas and two numbers. ? The matching pattern is non greedy when the character is immediately followed by any other qualifier (*, +,,,, {n}, {n,}, {n, m}). The non greedy pattern matches the search string as little as possible, whereas the default greedy pattern matches the search string as much as possible. For example, for string oooo, o+ will

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档