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

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y...
Read more

Introduction to Kotlin Programming Language for Backend Development - The Coding Shala

Home >> Learn Kotlin >> Kotlin Introduction Are you looking for a powerful and reliable programming language for backend development? Look no further than Kotlin. Kotlin is a modern, statically typed programming language that has gained a lot of popularity in recent years. In this blog post, we'll take a look at what Kotlin is and why it's a great choice for backend development. What is Kotlin? Kotlin is a statically typed, cross-platform, general-purpose programming language that was developed by JetBrains in 2011. It is designed to be more concise, expressive, and safe than Java, the most widely used programming language for Android development. Kotlin can be compiled to run on the Java Virtual Machine (JVM), JavaScript, and native platforms, making it a versatile language for different types of applications. Why use Kotlin for backend development? Kotlin has several features that make it a suitable language for backend development, such as: Concisenes...
Read more

Java Program to Reverse a String using Stack - The Coding Shala

Home >> Java Programs >> Reverse a String using Stack  Hey there, welcome back to another post. In this post, we will learn how to reverse a string using a stack in Java. Java Program to Reverse a String using Stack As we know,  Stack data structure follows last in the first out (LIFO), so by using stack we can reverse a given string. For example:  Input: hello output: olleh After storing into stack Stack -> o l l e h Now print stack -> olleh Java Program:  import java.util.Scanner; import java.util.Stack; /** * https://www.thecodingshala.com/ */ public class Main { public static String doReverse(String str) { Stack<Character> stack = new Stack<>(); // push all characters into stack for ( int i = 0; i < str.length(); i++) { stack.push(str.charAt(i)); } // pop characters from stack and build s...
Read more