The Indian Financial System Code is an abbreviation. Indian bank branches participating in the electronic funds transfer system are identified by a special 11-character code. The Reserve Bank of India uses this code in internet transactions to transfer funds between banks. IFSC code is divided into two parts. Banks are identified by the first four characters, while branches are identified by the last six characters. NEFT (National Electronic Funds Transfer), RTGS (Real Time Gross Settlement) and IMPS (Immediate Payment Service) are some of the electronic transactions that require IFSC codes.

Method

Some common ways to validate IFSC codes using regular expressions are:

• Check whether the length is correct.

• Check the first four characters.

• Check the fifth character.

• Check the last six characters .

Method 1: Check the correct length

11 characters should make up the IFSC Code. To determine the length, use the following regular expression ?

^.{11}$

This regular expression matches any 11 characters.

grammar

Use regular expressions to verify the IFSC code, you can use syntax to check the correct length ?

^([A-Z]{4}[0][A-Z0-9]{6})$ 

• ^ Marks the beginning of the string

• ([A-Z]{4} Matches the first 4 characters of the IFSC code, which should be uppercase letters

• [0] Matches the fifth character of the IFSC code, which should be zero

• [A-Z0-9]{6} Matches the last 6 characters of IFSC code, which should be either uppercase letters or numbers.

• $ Marks the end of the string

This regular expression guarantees that the IFSC code contains 11 characters, including 4 uppercase letters, a zero, and then 6 uppercase letters or numbers.

algorithm

Here is a detailed procedure for utilizing regular expressions to validate an IFSC code's length ?

Step 1 ? Describe the regular expression pattern for an IFSC code: An IFSC code is an 11-character alphanumeric code. The bank code is represented by first four characters, branch code by the last six characters , and always-zero fifth character. An IFSC code's regular expression pattern is as follows?

[A-Z]{4}[0] [A-Z0-9]{6} $

Step 2 - Check the regular expression pattern: You can use online regular expression testing tools such as regex101.com and regexr.com to test the regular expression pattern. Enter the pattern into the test tool and then enter an IFSC code to check if it matches the pattern.

Step 3 ? Verify the length of the IFSC code: After conducting the pattern test, you must verify the length of the IFSC code. The len() method in Python can be used to determine if the IFSC code is the exact length required, which is 11 characters.

Step 4 - Use a regular expression pattern: After determining the length, you can use a regular expression pattern to determine if the IFSC code is formatted as expected. To apply this pattern to IFSC codes in Python, use the re module.

Example 1

In this case, the IFSC code is validated using the regular expression [A-Z]40[A-Z0-9]6$. Regular expression matches the following pattern ?

• The first four letters of the code (from [A-Z]) must be uppercase.

• The number zero (0) must be the fifth character.

• The last six characters ([A-Z0-9]6$] can be uppercase letters or numbers.

Use the regex_match function to match ifsc_code strings and regular expressions. If the string matches the regular expression, the code is considered valid. If it does not match, it is considered invalid.

#include <iostream>
#include <regex>

using namespace std;

int main() {
   string ifsc_code = "SBIN0000123"; // Example IFSC code
   regex ifsc_regex("^[A-Z]{4}0[A-Z0-9]{6}$"); // Regular expression for IFSC code
    
   if (regex_match(ifsc_code, ifsc_regex)) {
      cout << "Valid IFSC code\n";
   } else {
      cout << "Invalid IFSC code\n";
   }
   return 0;
}

Output

Valid IFSC code

Method 2: Check the first four characters

The first four characters of IFSC Code identify the bank. One can use a regular expression to check that the first four characters are alphabets.

^[A-Z]{4} 

This regular expression matches any four uppercase letters.

grammar

This is a regular expression for checking the first four characters of the IFSC code -

^([A-Z]{4})

This regular expression uses the following syntax -

• ^ Matches the beginning of the string.

• [A-Z] Matches any uppercase letter.

• {4} Specifies that the preceding pattern should appear exactly four times.

• () Creates a capture group to extract the matched text.

This regular expression will match any string starting with four uppercase letters. To verify the entire IFSC code, other conditions than the first four characters need to be checked.

algorithm

Here is a step-by-step algorithm for validating the first four characters of an IFSC code using a regular expression ?

步驟1 ? 為IFSC代碼的前四個(gè)字符指定正則表達(dá)式模式。前四個(gè)字符應(yīng)僅使用字母，其中前兩個(gè)字符代表銀行代碼，后兩個(gè)字符代表位置代碼?？梢杂谜齽t表達(dá)式表示為[A-Z]4。

Step 2 ? Obtain the input IFSC code that requires validation.

第三步 - 刪除提供的IFSC代碼的前四個(gè)字符。

Step 4 ? Verify whether the extracted first four characters fit the specified pattern using the regular expression match () function. The input IFSC code is regarded as valid if the match is successful and the validation is successful. If there is no match, the validation is unsuccessful and the input IFSC code is deemed invalid.

Note: This algorithm only checks the first four characters of the IFSC code. The complete validation of the IFSC code requires additional checks for the remaining characters.

Example 2

In this illustration, the IFSC code we want to validate is represented by the string "ifsc_code." Then, in accordance with the IFSC code format, we build a regular expression pattern using the std::regex class that matches any string that begins with four letters.

然后，使用std::regex_search函數(shù)檢查ifsc_code字符串是否與正則表達(dá)式模式匹配。如果匹配成功，則輸出一個(gè)通知，說(shuō)明IFSC代碼是合法的。如果不匹配，則輸出一個(gè)通知，說(shuō)明IFSC代碼無(wú)效。

#include <iostream>
#include <regex>

int main() {
   std::string ifsc_code = "ABCD123456";
   std::regex pattern("^[A-Za-z]{4}");
  
   if (std::regex_search(ifsc_code, pattern)) {
      std::cout << "IFSC code is valid." << std::endl;
   } else {
      std::cout << "IFSC code is invalid." << std::endl;
   }
   return 0;
}

Output

IFSC code is valid.

Method 3: Check the fifth character

The fifth character of the IFSC Code is a zero (0) and is reserved for future use. One can use a regular expression to check that the fifth character is a zero.

^.{4}0

這個(gè)正則表達(dá)式匹配任意四個(gè)字符后面跟著一個(gè)零。

語(yǔ)法

To check the fifth character and validate an IFSC code using a regular expression, you can use the following general syntax ?

^[A-Z]{4}[0]{1}[A-Z0-9]{6}$

• ^ and $ represent the start and end of the string, respectively, ensuring that the entire string matches the pattern.

• [A-Z]{4} 匹配正好四個(gè)大寫字母字符。這表示銀行代碼。

• [0]{1} 匹配正好一個(gè)零。這代表了IFSC代碼中的第五個(gè)字符。

• [A-Z0-9]{6} 匹配恰好六個(gè)字符，可以是大寫字母或數(shù)字。這代表分行代碼。

• 總的來(lái)說(shuō)，該模式匹配以四個(gè)大寫字母開(kāi)頭，后跟一個(gè)零，并以六個(gè)大寫字母或數(shù)字結(jié)尾的IFSC代碼。

算法

這里有一個(gè)使用正則表達(dá)式檢查IFSC代碼第五個(gè)字符的算法 -

步驟 1 ? 輸入 IFSC 代碼。

Step 2 ? Define the regular expression pattern for IFSC codes: "^.{4}.{1}.*$"

Step 3 ? Use the regular expression pattern to match the input IFSC code.

Step 4 ? If there is a match ?

• 獲取IFSC代碼的第五個(gè)字符。

• Check if the fifth character is valid according to your criteria (e.g., a specific range of characters, specific characters, etc.).

• If the fifth character is valid: - Output "IFSC code is valid."

• If the fifth character is not valid: - Output "IFSC code is not valid."

第五步 - 如果沒(méi)有匹配 -

• Output "IFSC code is not valid."

Example 3

示例 3

一個(gè)在C++中的示例，展示了如何利用正則表達(dá)式來(lái)檢查IFSC代碼的第五個(gè)字符，而不需要用戶輸入

在這個(gè)例子中，IFSC代碼“SBIN0001234”被用作樣本代碼。為了匹配IFSC代碼的結(jié)構(gòu)，使用了一個(gè)正則表達(dá)式模式[A-Za-z]40[A-Z0-9]6$。提取第五個(gè)字符，然后驗(yàn)證代碼是否符合該模式。如果第五個(gè)字符是大寫字母，則被接受。否則，它是無(wú)效的。

#include <iostream>
#include <regex>

int main() {
   std::string ifscCode = "SBIN0001234"; // Example IFSC code

   // Regular expression pattern to match IFSC code
   std::regex pattern("^[A-Za-z]{4}0[A-Z0-9]{6}$");

   // Check if the IFSC code matches the pattern
   if (std::regex_match(ifscCode, pattern)) {
      // Extract the fifth character
      char fifthCharacter = ifscCode[4];

      // Perform validation on the fifth character
      if (std::isalpha(fifthCharacter) && std::isupper(fifthCharacter)) {
         std::cout << "Fifth character is valid: " << fifthCharacter << std::endl;
      } else {
         std::cout << "Fifth character is invalid: " << fifthCharacter << std::endl;
      }
   } else {
      std::cout << "Invalid IFSC code." << std::endl;
   }
   return 0;
}

Output

Fifth character is invalid: 0

Method 4: Check the last six characters

IFSC代碼的最后六個(gè)字符標(biāo)識(shí)分支機(jī)構(gòu)。您可以使用正則表達(dá)式來(lái)檢查最后六個(gè)字符是否為字母數(shù)字。

^.{4}[A-Z0-9]{6}$

This regular expression matches any four characters followed by six alphanumeric characters.

By combining the above regular expressions, you can create a regular expression to validate the entire IFSC Code.

^[A-Z]{4}0[A-Z0-9]{6}$

這個(gè)正則表達(dá)式匹配任何有效的IFSC代碼。

語(yǔ)法

The regular expression pattern ^[A-Z]{4}\d{6}$ consists of the following components ?

• ^ indicates the start of the string.

• [A-Z]{4} 匹配正好四個(gè)大寫字母字符。

• \d{6} 匹配正好六個(gè)數(shù)字。

• $ indicates the end of the string.

算法

使用正則表達(dá)式檢查IFSC代碼的最后六個(gè)字符，您可以按照以下算法進(jìn)行操作 -

步驟 1 ? 定義一個(gè)正則表達(dá)式模式，該模式匹配 IFSC 編碼的最后六個(gè)字符。例如，該模式可以是 "[A-Z0-9]{6}"。

步驟 2 - 創(chuàng)建一個(gè)用于測(cè)試的樣本 IFSC 代碼列表。這些代碼應(yīng)該是有效的 IFSC 代碼。

第三步 - 對(duì)列表中的每個(gè)IFSC代碼 -

Extract the last six characters from the IFSC code.

使用正則表達(dá)式模式來(lái)匹配提取的字符。

If the match is successful, the last six characters are valid.

If the match fails, the last six characters are not valid.

第四步 - 打印每個(gè)IFSC代碼的結(jié)果（有效或無(wú)效）。

Example 4

示例 4

在這里，我們定義了一個(gè)正則表達(dá)式模式[A-Z0-9] $，它匹配任何一組大寫字母（A-Z）或數(shù)字（0-9），恰好出現(xiàn)六次（6），在字符串的末尾（$）。然后，為了檢查ifscCode字符串是否與模式匹配，我們使用std::regex_match()。在這種情況下，我們發(fā)布"IFSC code is valid"，而在沒(méi)有匹配的情況下，我們打印"IFSC code invalid"。

#include <iostream>
#include <regex>

int main() {
   std::string ifscCode = "SBIN0001234";  // Example IFSC code

   // Regular expression pattern to match the last six characters of an IFSC code
   std::regex pattern("[A-Z0-9]{6}$");

   // Checking if the last six characters of the IFSC code match the pattern
   if (std::regex_match(ifscCode, pattern)) {
      std::cout << "IFSC code is valid." << std::endl;
   } else {
      std::cout << "IFSC code is invalid." << std::endl;
   }
   return 0;
}

Output

IFSC code is invalid.

Conclusion

總之，利用正則表達(dá)式來(lái)驗(yàn)證IFSC代碼可以是一種實(shí)用且有效的技術(shù)，以確保代碼的格式正確。任何不符合所需模式的輸入都可以使用正則表達(dá)式標(biāo)記為無(wú)效，以定義IFSC代碼必須遵循的模式。

Prior to applying regular expressions to validate an IFSC code, it's critical to comprehend the format and structure of the code. The bank code is represented by the first four characters of the IFSC code, the branch code by the next six characters, and the zero as the fifth character.

The above is the detailed content of How to validate IFSC code using regular expressions?. For more information, please follow other related articles on the PHP Chinese website!