Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles on Trending Technologies
Technical articles with clear explanations and examples
what is the hierarchical structure of programming languages in compiler design?
A programming language is an artificial language that can control the behaviour of a machine, specifically in computers. Programming language like natural languages is defined by syntactic and semantic rules which define their structure and meaning respectively. The hierarchical structure of programming languages is as follows −Programs − Computer programs are instructions for a computer. A computer needed programs to function, generally executing the program’s instructions in the main processor. The program has an executable form that the computer can use directly to execute the instructions. The equivalent program in its human-readable source program form, from which executable programs are ...
Read MoreNeon Number in C++
A neon number is a number where the sum of digits of the square of the number is equal to the number. Let's take an example.n = 9square = 81sum of digits of square = 8 + 1 = 9So, the number 9 is a neon number.We need to check whether the given number is a neon number or not. If the given number is a neon number, then print Yes else print No.AlgorithmInitialise the number n.Find the square of the number.Find the sum of the digits of the squareIf the sum of digits of the square is equal to ...
Read MoreNearest prime less than given number n C++
We are given a number n, we need to find the nearest prime number that is less than n. We can find the number easily if we start checking from the n - 1. Let's see some examples.Input10Output7AlgorithmInitialise the number n.Write a loop that iterates from n - 1 to 1Return the first prime number that you foundReturn -1 if you didn't find any prime that's less than given nImplementationFollowing is the implementation of the above algorithm in C++#include using namespace std; bool isPrime(int n) { if (n == 2) { return true; } ...
Read MoreNarayana number in C++
The Narayana numbers can be expressed in terms of binomial expression $1/n\binom{n}{k} \binom{n}{k-1}$ Learn more about the Narayana number here.You are given the numbers n and k. Find the Narayana number. It's a straightforward problem having the combinations formula. Let's see the code.AlgorithmInitialise the numbers n and k.Find the Narayana number using the given formula.Print the resultant number.ImplementationFollowing is the implementation of the above algorithm in C++#include using namespace std; int factorial(int n) { int product = 1; for (int i = 2; i
Read MoreN'th Smart Number in C++
A smart number is a number that contains at least three distinct prime factors. You are given a number N. Find the n-th smart number.The smart number series are30, 42, 60, 66, 70, 78...AlgorithmInitialise the number N.Initialise the count to 0.Write a function that checks whether the given number is prime or not.Write a function that checks whether the number is smart or not.Write a loop that iterates from 30 as first smart number is 30.Check whether the current number is smart number or not using the prime number function.Increment the count by 1 when you find a smart number.Return ...
Read MoreWhat is Chomsky Hierarchy in compiler design?
The Chomsky hierarchy is a collection of various formal grammars. With the use of this formal grammar, it can generate some formal languages. They can be defined by multiple types of devices that can identify these languages such as finite state automata, pushdown automata, linear bounded automata, and Turing machines, respectively.Chomsky has suggested four different classes of phrase structure grammar as follows −Type-0 Grammar (Unrestricted Grammar) − Type-0 grammar is constructed with no restrictions on the replacement rule. A non-terminal must appear in the string on the left side. The language generated is called recursively enumerable language.Thus, type-0 grammar isAn ...
Read MoreWhat is binding and binding time in compiler design?
The binding of a program element to a specific characteristic or property is the choice of the property from a set of possible properties. The time during program organization or processing when this choice is made is defined as the binding time of that property for that element. There are multiple varieties of bindings in programming languages, and a variety of binding times. It can also involve within the terms of binding and binding time the properties of program elements that are constant either by the definition of the language or its execution.Types of Binding TimesThere are two types of ...
Read MoreWhat are the effects of language design in the programming environment?
Programming environments have affected language design generally in two major areas such as features promoting separate compilation and assembly of a program from components, and features aiding program testing and debugging.Separate compilation − In the structure of any huge program it is regularly desirable to have multiple programmers or programming group design, code, and test elements of the program before the last assembly of all the elements into a complete program. This needed the language to be structured so that single subprograms or other elements can be separately compiled and implemented, without the other element, and thus later combined without ...
Read MoreWhat is Type Conversion?
The type conversion is an operation that takes a data object of one type and creates the equivalent data objects of multiple types. The signature of a type conversion operation is given as conversion_op :type1→type2There are two types of type conversions which are as follows −Implicit type conversion (Coercions) − The programming languages that enable mixed-mode expressions should describe conventions for implicit operand type conversions.Coercion is defined as an automatic conversion between types. For example in Pascal, if the operands for the addition operation are of integer type and other real types, ...
Read MoreWhat is Static Type Checking?
Type checking is the activity of providing that the operands of an operator are of compatible types. A compatible type is one that is legal for the operator or is enabled under language rules to be implicitly modified by compiler-generated code to a legal type. This automatic conversion is known as coercion. A type error is the application of an operator to an operand of an improper type. It can illustrate the concept of type checking considers the following statement.c:=a + 3 * b;Here b should be of a type that allows multiplication by an integer. Similarly, the operands for ...
Read More