Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 1037369
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 16, 20262026-05-16T14:50:40+00:00 2026-05-16T14:50:40+00:00

how do I write an expression which checks for lowcaps, dots, and without any

  • 0

how do I write an expression which checks for lowcaps, dots, and without any white space in the string?

the code below so far was trying to check for lowcaps and dots (it does not work anyway!) but I don’t know how to add in the expression for white spaces.

# check for matches of lowcaps or lowcaps with a dot
if (!preg_match('/([a-z0-9]|[a-z0-9\.])/', $cst_value))
{
  $error = true;
  echo ' please use lowcaps only with dot(s) and without any spacing.';
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-16T14:50:40+00:00Added an answer on May 16, 2026 at 2:50 pm

    [a-z0-9.] matches a lower-case letter or a digit or a dot.
    [^a-z0-9.] matches all characters that are not a lower-case letter or a digit or a dot.
    So if /[^a-z0-9.]/ matches anywhere the string contains something other than lc-letter,digit or dot. If it does not match your condition is fulfilled.

    if ( !preg_match('/[^a-z0-9.]/', $cst_value) ) {
      // only lower-case letters, digits or dots
    }
    

    or without digits

    if ( !preg_match('/[^a-z.]/', $cst_value) ) {
      // only lower-case letters or dots
    }
    

    update: example:

    foreach( array('abcdef', 'abc de', 'abc.de', 'aBcde') as $cst_value) {
      echo $cst_value, ': ';
      if ( !preg_match('/[^a-z.]/', $cst_value) ) {
        echo " ok.\n";
      }
      else {
        echo "failure\n";
      }
    }
    

    prints

    abcdef:  ok.
    abc de: failure
    abc.de:  ok.
    aBcde: failure
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Is it possible to write a regular expression which checks if a string (some
I am trying to write regular expression for this pattern: String word=113(112,9); It should
I'm trying to write a regular expression which specifies that text should start with
I have to write a .NET Regular Expression which validates if a string is
I'm trying to write a regular expression which should be able to identify boolean
Is it possible to write a regular expression which will match any subset of
I want to write a regular expression in a C++ program which checks if
My task is to write an app(unfortunatly on C) which reads expression in infix
I’m trying to write a grammar for a language which allows the following expressions:
I am trying to write a regular expression that will detect a word that

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.