How to validate HTML tag using Regular Expression Last Updated : 03 Feb, 2023 Summarize Comments Improve Suggest changes Share Like Article Like Report Given string str, the task is to check whether it is a valid HTML tag or not by using Regular Expression.The valid HTML tag must satisfy the following conditions: It should start with an opening tag (<).It should be followed by a double quotes string or single quotes string.It should not allow one double quotes string, one single quotes string or a closing tag (>) without single or double quotes enclosed.It should end with a closing tag (>). Examples: Input: str = "<input value = '>'>"; Output: true Explanation: The given string satisfies all the above mentioned conditions.Input: str = "<br/>"; Output: true Explanation: The given string satisfies all the above mentioned conditions.Input: str = "br/>"; Output: false Explanation: The given string doesn't starts with an opening tag "<". Therefore, it is not a valid HTML tag.Input: str = "<'br/>"; Output: false Explanation: The given string has one single quotes string that is not allowed. Therefore, it is not a valid HTML tag.Input: str = "<input value => >"; Output: false Explanation: The given string has a closing tag (>) without single or double quotes enclosed that is not allowed. Therefore, it is not a valid HTML tag. Approach: The idea is to use Regular Expression to solve this problem. The following steps can be followed to compute the answer. Get the String.Create a regular expression to check valid HTML tag as mentioned below: regex = "<("[^"]*"|'[^']*'|[^'">])*>"; Where: < represents the string should start with an opening tag (<).( represents the starting of the group."[^"]*" represents the string should allow double quotes enclosed string.| represents or.'[^']*' represents the string should allow single quotes enclosed string.| represents or.[^'">] represents the string should not contain one single quote, double quotes, and ">".) represents the ending of the group.* represents 0 or more.> represents the string should end with a closing tag (>).Match the given string with the regular expression. In Java, this can be done by using Pattern.matcher().Return true if the string matches with the given regular expression, else return false. Below is the implementation of the above approach: C++ // C++ program to validate the // HTML tag using Regular Expression #include <iostream> #include <regex> using namespace std; // Function to validate the HTML tag. bool isValidHTMLTag(string str) { // Regex to check valid HTML tag. const regex pattern("<(\"[^\"]*\"|'[^']*'|[^'\">])*>"); // If the HTML tag // is empty return false if (str.empty()) { return false; } // Return true if the HTML tag // matched the ReGex if(regex_match(str, pattern)) { return true; } else { return false; } } // Driver Code int main() { // Test Case 1: string str1 = "<input value = '>'>"; cout << ((isValidHTMLTag(str1)) ? "true" : "false") << endl; // Test Case 2: string str2 = "<br/>"; cout << ((isValidHTMLTag(str2)) ? "true" : "false") << endl; // Test Case 3: string str3 = "br/>"; cout << ((isValidHTMLTag(str3)) ? "true" : "false")<< endl; // Test Case 4: string str4 = "<'br/>"; cout << ((isValidHTMLTag(str4))? "true" : "false") << endl; return 0; } // This code is contributed by yuvraj_chandra Java // Java program to validate // HTML tag using regex. import java.util.regex.*; class GFG { // Function to validate // HTML tag using regex. public static boolean isValidHTMLTag(String str) { // Regex to check valid HTML tag. String regex = "<(\"[^\"]*\"|'[^']*'|[^'\">])*>"; // Compile the ReGex Pattern p = Pattern.compile(regex); // If the string is empty // return false if (str == null) { return false; } // Find match between given string // and regular expression // using Pattern.matcher() Matcher m = p.matcher(str); // Return if the string // matched the ReGex return m.matches(); } // Driver Code. public static void main(String args[]) { // Test Case 1: String str1 = "<input value = '>'>"; System.out.println(isValidHTMLTag(str1)); // Test Case 2: String str2 = "<br/>"; System.out.println(isValidHTMLTag(str2)); // Test Case 3: String str3 = "br/>"; System.out.println(isValidHTMLTag(str3)); // Test Case 4: String str4 = "<'br/>"; System.out.println(isValidHTMLTag(str4)); } } Python3 # Python3 program to validate # HTML tag using regex. # using regular expression import re # Function to validate # HTML tag using regex. def isValidHTMLTag(str): # Regex to check valid # HTML tag using regex. regex = "<(\"[^\"]*\"|'[^']*'|[^'\">])*>" # Compile the ReGex p = re.compile(regex) # If the string is empty # return false if (str == None): return False # Return if the string # matched the ReGex if(re.search(p, str)): return True else: return False # Driver code # Test Case 1: str1 = "<input value = '>'>" print(isValidHTMLTag(str1)) # Test Case 2: str2 = "<br/>" print(isValidHTMLTag(str2)) # Test Case 3: str3 = "br/>" print(isValidHTMLTag(str3)) # Test Case 4: str4 = "<'br/>" print(isValidHTMLTag(str4)) # This code is contributed by avanitrachhadiya2155 C# // C# program to validate // HTML tag using regex. using System; using System.Text.RegularExpressions; class GFG { // Function to validate // HTML tag using regex. public static bool isValidHTMLTag(string str) { // Regex to check valid HTML tag. string regex = "<(\"[^\"]*\"|'[^']*'|[^'\">])*>"; // Compile the ReGex Regex p = new Regex(regex); // If the string is empty // return false if (str == null) { return false; } // Find match between given string // and regular expression // using Pattern.matcher() Match m = p.Match(str); // Return if the string // matched the ReGex return m.Success; } // Driver Code. public static void Main() { // Test Case 1: string str1 = "<input value = '>'>"; Console.WriteLine(isValidHTMLTag(str1)); // Test Case 2: string str2 = "<br/>"; Console.WriteLine(isValidHTMLTag(str2)); // Test Case 3: string str3 = "br/>"; Console.WriteLine(isValidHTMLTag(str3)); // Test Case 4: string str4 = "<'br/>"; Console.WriteLine(isValidHTMLTag(str4)); } } // This code is contributed by Aman Kumar. JavaScript // Javascript program to validate // HTML tag using regex. // Function to validate // HTML tag using regex. function isValidHTMLTag(str) { // Regex to check valid HTML tag. let regex = new RegExp(/<(\"[^\"]*\"|'[^']*'|[^'\">])*>/); // If the string is empty // return false if (str == null) { return "false"; } // Find match between given string // and regular expression if (regex.test(str) == true) { return "true"; } else { return "false"; } } // Driver Code. // Test Case 1: let str1 = "<input value = '>'>"; console.log(isValidHTMLTag(str1)+"<br>"); // Test Case 2: let str2 = "<br/>"; console.log(isValidHTMLTag(str2)+"<br>"); // Test Case 3: let str3 = "br/>"; console.log(isValidHTMLTag(str3)+"<br>"); // Test Case 4: let str4 = "<'br/>"; console.log(isValidHTMLTag(str4)+"<br>"); // This code is contributed by Utkarsh Kumar Output: true true false false false Time Complexity: O(N) for each test case, where N is the length of the given string. Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article How to validate HTML tag using Regular Expression P prashant_srivastava Follow Improve Article Tags : Strings Pattern Searching Web Technologies HTML DSA java-regular-expression CPP-regex regular-expression +4 More Practice Tags : Pattern SearchingStrings Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read JavaScript Tutorial JavaScript is a programming language used to create dynamic content for websites. It is a lightweight, cross-platform, and single-threaded programming language. It's an interpreted language that executes code line by line, providing more flexibility.JavaScript on Client Side: On the client side, Jav 11 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 4 min read Like