Turing Machine
What is Turing Machine in TOC? Turing Machine recognizes the recursive enumerable language. Turing Machine is more powerful than any
Read More
Computer Science & Information Technology
GATE CSE Free Resources by MADE EASY – Notes, Papers & Expert Guidance
Get ready for GATE CSE with MADE EASY’s free resources. Access comprehensive notes, previous years’ question papers, and expert strategies to boost your preparation and succeed in Computer Science Engineering.
Greibach Normal Form (GNF)
Greibach Normal Form (GNF) in Compiler Design A CFG G = (V, T, P, S) is in Greibach Normal Form
Read MoreChomsky Normal Form (CNF)
Chomsky Normal Form (CNF) in Compiler Design Any context free grammar G = (V, T, S, P) with λ ∉
Read MoreLeft Most Derivation and Right Most Derivation
Left Most Derivation and Right Most Derivation – Computer Science In CFGs that are not linear, a derivation way involve
Read MoreContext Free Grammar
Definition A context-free grammar G is a quadruple (V, T, P, S), where: V is the set of non-terminals. (Non-terminals
Read MoreRegular Expressions
Regular Expression in Compiler Design One day of describing regular language of via the notation of regular expressions. This notation
Read MoreDETERMINISTIC FINITE AUTOMATA (DFA)
What is deterministic finite automata? If for every input symbol of an alphabet there is an exactly one transition from
Read More
What is Theory of Computation?
Theory of computation deals with the automata theory and formal languages. It is the study of “Abstract Model of Computation”.
Read MoreFinite Automata
What is Finite Automata? Finite Automaton (FA) is also called as Finite State machine (FSM). Finite Automaton has no temporary
Read MoreSequential Circuits
All the digital systems designed and analyzed so far are based upon combinational logic, where the output levels at any
Read MoreCONVERSION AMONG RADICES
Convert from Decimal to Any Base Let’s think about what you do to obtain each digit. As an example, let’s
Read MoreRadix Number System
The numeric system we use daily is the decimal system, but this system is not convenient for machines since the
Read More
What is Computer Organization and Architecture? – Computer Science
Computer science is an ever-evolving field that offers candidates academic success and a bright career, provided they build a strong
Read MoreSyntax Directed Definition
A syntax directed definition is a context-free grammar in which Each grammar symbol X is associated with two finite sets
Read MoreSyntax Analysis Parser
In the syntax analysis phase, a compiler verifies whether or not the tokens generated by the lexical analyzer are grouped
Read MoreTokens, Patterns and Lexemes
A token is a pair consisting of a token name and an optional attribute value. The token name is an
Read MoreLexical Analysis
As the first phase of compiler, the main task of the lexical analyzer is to read the input characters of
Read MoreCompiler Program
Compiler A compiler is a program that reads a program written in one language the source language-and translates into an
Read More