Posix অক্ষর ক্লাস \p{আলফা} জাভা রেজেক্স

এই শ্রেণীটি বড় হাতের এবং ছোট হাতের উভয় বর্ণের অক্ষরের সাথে মিলে যায়।

উদাহরণ 1

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Example {
   public static void main( String args[] ) {
      //Regular expression to match lower case letters
      String regex = "^\\p{Alpha}+$";
      //Getting the input data
      Scanner sc = new Scanner(System.in);
      System.out.println("Enter 5 input strings: ");
      String input[] = new String[5];
      for (int i=0; i<5; i++) {
         input[i] = sc.nextLine();
      }
      //Creating a Pattern object
      Pattern p = Pattern.compile(regex);
      System.out.println("Strings with alphabets: ");for(int i=0; i<5;i++) {
         //Creating a Matcher object
         Matcher m = p.matcher(input[i]);
         if(m.matches()) {
            System.out.println(m.group());
         }
      }
   }
}

আউটপুট

Enter 5 input strings:
hello
sample
243test
##$$@
222356
Strings with alphabets:
hello
sample

উদাহরণ 2

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Example {
   public static void main(String args[]) {
      //Reading String from user
      System.out.println("Enter a string");
      Scanner sc = new Scanner(System.in);
      String input = sc.nextLine();
      //Regular expression
      String regex = "[\\p{Alpha}]";
      //Compiling the regular expression
      Pattern pattern = Pattern.compile(regex);
      //Retrieving the matcher object
      Matcher matcher = pattern.matcher(input);
      int count = 0;
      while(matcher.find()) {
         count++;
      }
      System.out.println("Number of alphabetic characters: "+count);
   }
}

আউটপুট

Enter a string
sample text
Number of alphabetic characters: 10