Target MachineA target machine is a byte-addressable machine. This machine has n general-purpose registers, R0, R1,…..Rn-1. A Simple Target Machine Model has three-address instruction. A full-edged assembly language would have a variety of instructions. The Read more…
Given a string and a positive integer k, find all distinct substrings of a given string of any length containing exactly k distinct characters. For example, A simple solution is to generate all substrings of Read more…
Conversion of DFA to Regular expressionTo convert the DFA to Regular Expression (RE), we are going to use a method called converting DFA to regular expression by eliminating states. This method is used to obtain Read more…
The Jenkins pipeline is a collection of codes written in a Jenkins file, allows the Jenkins to operate in a sequence. It provides a platform to run each job simultaneously. The pipeline enables the workflow Read more…
What does it do? It’s a tool to automatically refactor your project to follow coding standards – for example @var annotations – and to upgrade your codebase from any legacy version of PHP to any Read more…
Regular ExpressionsRegular expressions are also referred as rational expressions, which are used to describe the algebraic description of regular languages. It is generally a sequence of characters that is used to find a string in Read more…
Pumping Lemma for Regular LanguagesThe language accepted by the finite automata is called Regular Language. If we are given a language L and asked whether it is regular or not? So, to prove a given Read more…
basically same speed, but c# is sometimes a lot faster is there a better benchmark? slightly off topic, if go isn’t really faster than c#, why use it in the first place? subjective thoughts welcomed. Read more…
CLR parsing refers to the canonical lookahead. We will use the canonical collection of LR(1) items for the construction of the CLR(1) parsing table. Generally, CLR(1) parsing has more number of states as compared to Read more…
In this article, we will learn Derivation and Parse Tree. Derivations The parse tree can be constructed by taking a derivational view in which production is treated as rewriting rules. In each rewriting step, a Read more…