Simple XML Validator - The Coding Shala

Home >> Programming Questions >> XML Validator

 In this post, we will are going to implement a Simple XML Validator in the Java language.

Simple XML Validator in Java

The input is an ASCII string, we have to write a Java program to check if the given String is valid XML or not. For simplicity purposes, the XML string only has content and tags.

 The output should be a String for whether the text is valid XML or not. If the XML is invalid, output one of the three error strings:
1. "missing closing tag for <start_tag>"
2. "encountered closing tag without matching open tag for </end tag>"
3. "parse error"

Example 1:
Input: <a>some text</a>
Output: valid

Example 2:
Input: <a>
Output: missing closing tag for <a>

Approach
We can use the stack data structure.

Java Program:

class Solution {
	
	public String validate_xml(String xml) {
		
		if(xml == null || xml.isEmpty()) return "valid";
		
		Stack<String> stack = new Stack<>();
		int i = 0;
		while(i < xml.length()) {
			if(xml.charAt(i) == '<') {
				if(i < xml.length() && xml.charAt(i+1) == '/') {
					//closing tag
					i = i+2;
					StringBuilder end = new StringBuilder("<");
					while(xml.charAt(i) != '>') {
						if(xml.charAt(i) == '<') return "parse error";
						end.append(xml.charAt(i));
						i++;
					}
					if(end.length() == 1) return "parse error";
					end.append(">");
					if(stack.peek().equals(end.toString())) {
						stack.pop();
					} else {
						StringBuilder tag = new StringBuilder("</");
						for(int j=1; j<end.length(); j++) {
							tag.append(end.charAt(j));
						}
						return "encountered closing tag without matching open tag for " + tag.toString();
					}
				} else {
					//start tag
					i++;
					StringBuilder sb = new StringBuilder("<");
					while(xml.charAt(i) != '>') {
						if(xml.charAt(i) == '<') return "parse error";
						sb.append(xml.charAt(i));
						i++;
					}
					if(sb.length() == 1) return "parse error";
					sb.append(">");
					stack.push(sb.toString());
				}
			}
			i++;
		}
		
		if(!stack.isEmpty()) {
			return "missing closing tag for " + stack.pop();
		}
		
		return "valid";
	}
	
}


Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

LeetCode - Crawler Log Folder Solution - The Coding Shala

Home >> LeetCode >> Crawler Log Folder  In this post, we will learn how to solve LeetCode's Crawler Log Folder problem and will implement Crawler Log Folder Java Solution. Crawler Log Folder Problem The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: "../": Move to the parent folder of the current folder. (If you are already in the main folder, remain in the same folder). "./": Remain in the same folder. "x/": Move to the child folder named x (This folder is guaranteed to always exist). You are given a list of strings logs where logs[i] is the operation performed by the user at the ith step. The file system starts in the main folder, then the operations in logs are performed. Return the minimum number of operations needed to go back to the main folder after the change folder operations. Input: logs = ["d1/","d2/","../","d2
Read more

Richest Customer Wealth LeetCode Solution - The Coding Shala

Home >> LeetCode >> Richest Customer Wealth  In this post, we will learn how to solve LeetCode's Richest Customer Wealth problem and will implement its solution in Java. Richest Customer Wealth Problem You are given an m x n integer grid accounts where accounts[i][j] is the amount of money i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​th​​​​ bank. Return the wealth that the richest customer has.  A customer's wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum wealth. Example 1: Input: accounts = [[1,2,3],[3,2,1]] Output: 6 Explanation: 1st customer has wealth = 1 + 2 + 3 = 6 2nd customer has wealth = 3 + 2 + 1 = 6 Both customers are considered the richest with a wealth of 6 each, so return 6. Example 2: Input: accounts = [[1,5],[7,3],[3,5]] Output: 10 Example 3: Input: accounts = [[2,8,7],[7,1,3],[1,9,5]] Output: 17 Practice this problem on LeetCode . LeetCode - Richest Customer
Read more

Shell Script to find sum, product and average of given numbers - The Coding Shala

Home >> Scripting >> Sum, product and average Shell Script to find the sum, product, and the average of given numbers Read four integer numbers from the user and find the sum, product, and average of these four numbers? Code:  #! / bin / bash echo "enter four integers" read a b c d sum =$(echo "$a + $b + $c + $d" | bc - l) average=$(echo "$sum / 4" | bc - l) product=$(echo "$a * $b * $c * $d" | bc - l) echo "sum = $sum" echo "Average = $average" echo "Product = $product" Other Posts You May Like Shell script to print sum of the digits of a number Shell Script to print number in descending order Shell script to find out biggest number from three numbers Shell script to find out factorial of a number Shell Script to create a simple calculator Please leave a comment below if you like this post or found some error, it will help me to improve my content.
Read more

First Unique Character in a String Java - The Coding Shala

Home >> Interview Questions >> first unique character in a string First Unique Character in a String In this post, you will learn how to find the first unique character in a given string in Java. Given a string, find the first non-repeating character in it and return its index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. First Unique Character in a String Solution Approach 1: We can use HashMap. We Count every character's frequency and store it as value. Again check with string's char and if the value in the map is one return its index. Java Program:  class Solution { public int firstUniqChar ( String s ) { Map < Character , Integer > map = new HashMap < Character , Integer >(); for ( int i = 0 ; i < s . length (); i ++){ char ch = s . charAt ( i ); i
Read more

Add two numbers in Scala - The Coding Shala

Home >> Learn Scala >> Add Two Numbers  In this post, we will learn how to write a Scala program to Add Two Numbers. Add Two Numbers in Scala The following is the Scala program to Add two Numbers. Scala Program:  //add two numbers in scala //the coding shala object Main { def main ( args : Array [ String ]){ //we can take user input also val num1 = 10 ; val num2 = 20 ; //add both numbers val result = num1 + num2 ; println ( "Sum of " + num1 + " + " + num2 + " = " + result ); } } Other Posts You May Like Scala - Hello World Program Java - Hello World Program Power of Two Simple XML Validator Fibonacci Series Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
Read more