Skip to content

Tag Archives: regular-expression

Prefix Notation: Prefix notation is the notation in which operators are placed before the corresponding operands in the expression. Example:  Infix notation: A + B… Read More
POSIX stands for Portable Operating System Interface. It defines a set of standard operating system interfaces based on the UNIX OS. These standards are specified… Read More
Prerequisite – Introduction of Finite Automata Utility – To construct DFA from a given regular expression, we can first construct an NFA for the given… Read More
As the regular expressions can be constructed from Finite Automata using the State Elimination Method, the reverse method, state decomposition method can be used to… Read More
Prerequisite –  Finite automata, Regular expressions, grammar, and language. In this article, we will see some popular regular expressions and how we can convert them… Read More
Given a string str and a word w, the task is to print the number of the occurrence of the given word in the string… Read More
In this article, we will know How to clone a regular expression using JavaScript. We can clone a given regular expression using the constructor RegExp().… Read More
Given a string with space-separated or camel case or snake case letters, the task is to find the kebab case of the following string.  For… Read More
Given two strings text and pattern of length M and N respectively, the task is to check if the pattern matches the text or not.… Read More
Given a string S, the task is to move all the digits present in the string, to the beginning of the string. Examples: Input: S… Read More
Given a string S, the task is to find and extract all the URLs from the string. If no URL is present in the string,… Read More
Given a string str, the task is to extract the substrings present between two delimiters, i.e. ‘[‘ and ‘]’. Examples: Input: str = “[This is… Read More
Prerequisite – Introduction of Finite Automata Non-Deterministic Finite Automata and ∈-Non-Deterministic Finite Automata are almost the same except for their transition function and there are… Read More
State Elimination Method : Rules to convert a DFA/NFA//Ɛ-NFA into corresponding Regular Expression. Arden’s Method is not capable of converting Ɛ-NFA. By state elimination method… Read More
Given a string str of length N and a substring pattern of length M, the task is to find the frequency of occurrences of pattern… Read More

Start Your Coding Journey Now!