<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Aarushi Bhate on Medium]]></title>
        <description><![CDATA[Stories by Aarushi Bhate on Medium]]></description>
        <link>https://medium.com/@aarushi-bhate19?source=rss-d68fd1b09ac6------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*Rj1uDOGwBsrd_JhO.jpg</url>
            <title>Stories by Aarushi Bhate on Medium</title>
            <link>https://medium.com/@aarushi-bhate19?source=rss-d68fd1b09ac6------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sun, 22 Nov 2026 13:57:47 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@aarushi-bhate19/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[INTERPRETERS]]></title>
            <link>https://aarushi-bhate19.medium.com/interpreters-7d59a34a8652?source=rss-d68fd1b09ac6------2</link>
            <guid isPermaLink="false">https://medium.com/p/7d59a34a8652</guid>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[interpreters]]></category>
            <category><![CDATA[compilers]]></category>
            <dc:creator><![CDATA[Aarushi Bhate]]></dc:creator>
            <pubDate>Thu, 30 Jun 2022 03:06:21 GMT</pubDate>
            <atom:updated>2022-06-30T03:17:25.319Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*OXLssvyl9JqFapzM.png" /></figure><p>In computer science, an interpreter is a computer program that executes instructions written in a programming or scripting language directly without first compiling them into a machine language program. Interpreters typically use one of the following strategies to execute a program:</p><ul><li>Parse the source code and perform its behavior directly.</li><li>Translate source code into some efficient intermediate representation or object code and immediately execute that;</li><li>Explicitly execute stored precompiled bytecode made by a compiler and matched with the interpreter Virtual Machine.</li></ul><p>Early versions of the Lisp programming language and the BASIC dialects of minicomputers and microcomputers are examples of the first type.</p><p>Perl, Raku, Python, MATLAB, and Ruby are examples of the second type, and UCSD Pascal is an example of the third type.</p><p>The source program is precompiled and saved as machine-independent code. This code is linked at run time and executed by the interpreter or compiler (for JIT systems). Some systems, such as Smalltalk and the latest versions of BASIC and Java, can also combine the two and three. Various types of interpreters have also been built for many languages ​​traditionally associated with compilation, such as Algol, Fortran, Cobol, C, and C ++.</p><p>Interpretation and compilation are the two main means of implementing a programming language, but they are not mutually exclusive because most interpretation systems, such as compilers, also do some translation work. The terms “interpreted language” or “compiled language” mean that the standard implementations of that language are the interpreter and the compiler, respectively. High-level languages ​​are ideally implementation-independent abstractions.</p><p>As early as 1952, interpreters were used to facilitate programming within the limits of computers at the time (for example, lack of program memory or native support for floating point numbers). The interpreter was also used at a low level for translation between machine languages, so I was able to write code for a machine that was still under construction and test it on an existing computer. The first high-level language interpreted was Lisp. Lisp was first implemented on the IBM 704 computer by Steve Russell in 1958. Russell read John McCarthy’s article and realized that (McCarthy’s surprise) the LispEval function could be implemented in machine language. As a result, a Lisp interpreter that can be used to run Lisp programs and, more precisely, “evaluate Lisp expressions” has worked.</p><p>We will discuss some popular examples of Interpreters used nowadays:</p><ul><li>Ruby interpreter</li><li>Perl interpreter</li><li>MATLAB interpreter</li></ul><p><strong>Ruby interpreter</strong></p><p>A Ruby interpreter is any program that is able to interpret source code written in the Ruby language.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1000/0*bFBh0rxtgkMfUhe3.png" /></figure><p>There is no single version of the Ruby interpreter so that different human translators or interpreters can be used. Instead, there are some interpreter options for Ruby developers. Each version adds a slightly different “flavor” to the language.</p><p>How can I see that the interpreter I’m using is actually running “real” Ruby? Use Ruby Spec Suite (also known as ruby ​​/ spec). The Ruby Spec Suite is a set of tests to ensure that a particular Ruby implementation has the correct behavior and results when interpreting a program. Which Ruby interpreter to use is an open question for a particular situation.</p><p>If you have a standard version of Ruby installed, you are almost certainly using YARV (for Ruby 1.9 or later) or Ruby MRI (for Ruby 1.8 or later). In many cases, this default option is sufficient for Ruby developers. However, if your Ruby program has high performance requirements, Rubinius or JRuby may be a better choice. Benchmark tests show that Rubinius and JRuby perform about twice as well as Ruby MRI.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*NgZqPvM598fAa5V3.png" /></figure><p>Another consideration for using the Ruby interpreter is the issue of threads and concurrency. Ruby MRI uses a feature called the Global Interpreter Lock (GIL). The GIL prevents multiple program threads from accessing the same data at the same time. By default, Ruby is single-threaded and does not allow parallelism or multithreading.</p><p>However, this limitation does not exist in other implementations of Ruby interpreters such as Rubinius and JRuby. You can take full advantage of multi-core and multi-CPU systems to significantly improve performance.</p><p>The maturity of a Ruby implementation is usually measured by its ability to run the Ruby on Rails (Rails) framework because the implementation is complex and uses many Ruby-specific features. The point at which a particular implementation achieves this goal is called “rail peculiarity.” The reference implementations of JRuby and Rubiniu can all run Rails in production without any changes.</p><p><strong>Perl interpreter</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*qhcVsIIAj_noNtH0.png" /></figure><p>The perl executable, normally installed in<em> /usr/bin </em>or <em>/usr/local/bin</em> on your machine, is also called the perl interpreter. Every Perl program must be passed through the Perl interpreter in order to execute. The first line in many Perl programs is something like:</p><p><em>#!/usr/bin/perl</em></p><p>So what does the Perl interpreter do? It compiles the program internally into the parse tree and run it immediately. Perl is commonly known as an interpreted language, but it’s not entirely true. Interpreters are sometimes referred to as interpreters / compilers because they convert to bytecode before actually executing the program. The compiled form is not saved as a file, but Perl version 5.005 contains a working version of the standalone Perl compiler.</p><p>Perl’s overall structure is primarily derived from C. Perl is procedural in nature and has variables, expressions, assignment statements, curly blocks, control structures, and subroutines.</p><p>Perl also takes features from shell programming. All variables are marked with leading sigils, which allow variables to be interpolated directly into strings. However, unlike the shell, Perl uses sigils on all accesses to variables, and unlike most other programming languages that use sigils, the sigil doesn’t denote the type of the variable but the type of the expression. So for example, while an array is denoted by the sigil “@” (for example @arrayname), an individual member of the array is denoted by the scalar sigil “$” (for example $arrayname[3]). Perl also has many built-in functions that provide tools often used in shell programming (although many of these tools are implemented by programs external to the shell) such as sorting, and calling operating system facilities.[citation needed]</p><p>Perl gets the hash (“associative array”) from AWK and the regular expression from sed. These simplify many parsing, word processing, and data management tasks. What Lisp has in common is the implicit return of the last value in a block, and all statements are both larger and usable expressions.</p><p>Perl 5 adds features that support complex data structures, first-class functionality (that is, closures as values), and object-oriented programming models. These include references, packages, class-based method dispatch and lexical scope variables, and compiler directives (such as strict pragmas). An important additional feature introduced in Perl 5 was the ability to package code as a reusable module. “The overall purpose of the Perl 5 modular system was to drive the growth of the Perl culture, not the Perl core,” Wall later explained.</p><p>All versions of Perl perform automatic data entry and automatic memory management. The interpreter knows the type and storage requirements of each data object in the program. Use reference counting to allocate space for them and free them as needed (thus, you cannot free circular data structures without manual intervention). Legal type conversion — Example: B. Number to string conversion — Performed automatically at run time. Invalid type conversion is a fatal error.</p><p><strong>Matlab interpreter</strong></p><p>MATLAB (an abbreviation of “MATrix LABoratory”[22]) is a proprietary multi-paradigm programming language and numeric computing environment developed by MathWorks. MATLAB allows matrix manipulations, plotting of functions and data, implementation of algorithms, creation of user interfaces, and interfacing with programs written in other languages.</p><p>While MATLAB is primarily intended for numerical computation, the optional toolbox uses the MuPAD symbolic engine, which provides access to symbolic computation capabilities. An additional package, Simulink, adds multi-domain graphical simulation and model-based design for dynamic and embedded systems.</p><p>As of 2020, MATLAB has more than 4 million users worldwide. They come from different disciplines of technology, natural sciences and business.</p><p>MATLAB supports structure data types. Since all variables in MATLAB are arrays, the more appropriate name is “Structure Array”, and each element of the array has the same field name. MATLAB supports object-oriented programming such as classes, inheritance, virtual shipping, packaging, pass-by-value semantics, and pass-by-reference semantics. However, the syntax and calling conventions are very different from other languages.</p><p>MATLAB can call functions and subprograms written in the C or Fortran programming language. A wrapper function is created that can be used to pass MATLAB data types. A MEX file (MATLAB executable file) is a dynamically loadable object file created by compiling such a function. Since 2014, more and more bidirectional interfaces with Python have been added.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/722/0*P9vtA7vPWw2JvFOM.png" /></figure><p>Libraries written in Perl, Java, ActiveX, or .NET can be called directly from MATLAB, and many MATLAB libraries (such as XML or SQL support) are available as wrappers for implemented Java or ActiveX libraries. increase. Calling MATLAB from Java is more complicated, but you can do it using the MATLAB Toolbox, which is available separately from MathWorks, or by using an undocumented mechanism called JMI (Java-to-MATLAB Interface). I can do it.</p><p><strong>Conclusion</strong></p><p>Interpreters are often used to execute tag and glue languages ​​because each operator running in a tag language is usually a call to a complex routine such as an editor or compiler. Self-modifying code can be easily implemented in the interpreted language. This is related to the origin of interpretation in the study of Lisp and artificial intelligence. Machine code for hardware architectures can be executed using virtual machines. This is often used when the desired architecture is not available, especially when performing multiple copies.</p><p>Sandbox: Some types of sandboxes rely on operating system protection, but interpreters or virtual machines are often used. The actual hardware architecture and the originally intended hardware architecture may or may not be the same. This may seem pointless, except that the sandbox does not force you to actually execute every statement in the source code it processes. In particular, it may refuse to execute code that violates working security restrictions. An emulator designed to run computer software written for outdated and unavailable hardware on modern devices.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7d59a34a8652" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Application of TOC in Compilers]]></title>
            <link>https://aarushi-bhate19.medium.com/application-of-toc-in-compilers-78875a53ef46?source=rss-d68fd1b09ac6------2</link>
            <guid isPermaLink="false">https://medium.com/p/78875a53ef46</guid>
            <category><![CDATA[compilers]]></category>
            <category><![CDATA[theory-of-computation]]></category>
            <dc:creator><![CDATA[Aarushi Bhate]]></dc:creator>
            <pubDate>Fri, 10 Jun 2022 19:22:35 GMT</pubDate>
            <atom:updated>2022-06-10T19:22:35.214Z</atom:updated>
            <content:encoded><![CDATA[<p><strong>Introduction to Compilers</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*soK80KWLukKXoAjX.png" /></figure><p>A compiler interprets a software in a supply language to a software in a goal language. The maximum widely recognized shape of a compiler is one which interprets an excessive stage language like C into the local meeting language of a device in order that it could be executed. And of route there are compilers for different languages like C++, Java, C#, Rust, and plenty of others. The identical strategies utilized in a conventional compiler also are utilized in any form of software that strategies a language. For example, a typesetting software like TEX interprets a manuscript right into a Postscript file. A graph-format software like Dot consumes a listing of nodes and edges and arranges them on a screen.</p><p>An internet browser interprets an HTML file into an interactive graphical display. To write applications like these, you want to recognize and use the identical strategies as in conventional compilers. Compilers exist now no longer best to translate applications, however additionally to improve them. A compiler assists a programmer with the aid of locating mistakes in a software at runtime, in order that the person no longer ought to come across them at runtime. Usually, extra strict language consequences bring together-time mistakes. This makes the programmer’s task harder, however makes it much more likely that this system is correct. For example, the Ada language is notorious amongst programmers as difficult to jot down without bringing together-time mistakes, however as soon as working, is depended on to run safety-essential structures consisting of the Boeing 777 aircraft.</p><p><strong>Phases of the process of compilation</strong></p><p>Our focus will be primarily on the compiler proper, which is the most interesting component in the toolchain. The compiler itself can be divided into several stages:</p><p>The <strong>scanner</strong> consumes the plain text of a program, and groups together individual characters to form complete tokens. This is much like grouping characters into words in a natural language.</p><p>The <strong>parser </strong>consumes tokens and groups them together into complete statements and expressions, much like words are grouped into sentences in a natural language. The parser is guided by a grammar which states the formal rules of composition in a given language.</p><p>The output of the parser is an abstract syntax tree (AST) that captures the grammatical structures of the program. The AST also remembers where in the source file each construct appeared, so it is able to generate targeted error messages, if needed.</p><p>The <strong>semantic </strong>routines traverse the AST and derive additional meaning (semantics) about the program from the rules of the language and the relationship between elements of the program. For example, we might determine that x + 10 is a float expression by observing the type of x from an earlier declaration, then applying the language rule that addition between int and float values yields a float. After the semantic routines, the AST is often converted into an intermediate representation (IR) which is a simplified form of assembly code suitable for detailed analysis.</p><p>One or more <strong>optimizers</strong> can be applied to the intermediate representation, in order to make the program smaller, faster, or more efficient. Typically, each optimizer reads the program in IR format, and then emits the same IR format, so that each optimizer can be applied independently, in arbitrary order.</p><p>Finally, a <strong>code generator</strong> consumes the optimized IR and transforms it into a concrete assembly language program. Typically, a code generator must perform register allocation to effectively manage the limited number of hardware registers, and instruction selection and sequencing to order assembly instructions in the most efficient form.</p><p><strong>Lexical Analysis</strong></p><p><strong>Finite Automata:</strong> A finite automaton (FA) is an abstract machine that can be used to represent certain forms of computation. Graphically, an FA consists of a number of states (represented by numbered circles) and a number of edges (represented by labeled arrows) between those states. Each edge is labeled with one or more symbols drawn from an alphabet Σ. The machine begins in a start state S0. Scanning as the input symbol. Some states of the FA are known as accepting states and are indicated by a double circle. If the FA is in an accepting state after all input is consumed, then we say that the FA accepts the input. We say that the FA rejects the input string if it ends in a non-accepting state, or if there is no edge corresponding to the current input symbol. Every RE can be written as an FA, and vice versa.</p><p><strong>For a simple regular expression, one can construct an FA by hand. For example, here is an FA for the keyword for:</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*ZtZjZtEgUSQGgeVi" /></figure><p><strong>Deterministic Finite Automata</strong></p><p>Each of these three examples is a deterministic finite automaton (DFA). A DFA is a special case of an FA where every state has no more than one outgoing edge for a given symbol. Put another way, a DFA has no ambiguity: for every combination of state and input symbol, there is exactly one choice of what to do next. Because of this property, a DFA is very easy to implement in software or hardware. One integer © is needed to keep track of the current state. 16 3.4. FINITE AUTOMATA 17 The transitions between states are represented by a matrix (M[s,i]) which encodes the next state, given the current state and input symbol. (If the transition is not allowed, we mark it with E to indicate an error.) For each symbol, we compute c = M[s, i] until all the input is consumed, or an error state is reached.</p><p><strong>Nondeterministic Finite Automata</strong></p><p>The alternative to a DFA is a nondeterministic finite automaton (NFA). An NFA is a perfectly valid FA, but it has an ambiguity that makes it somewhat more difficult to work with. Consider the regular expression [a-z]*ing, which represents all lowercase words ending in the suffix ing. It can be represented with the following automaton: 0 3 [a-z].</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*kevhkRgaLI2mI0CB" /></figure><p>Now consider how this automaton would consume the word sing. It could proceed in two different ways. One would be to move to state 0 on s, state 1 on i, state 2 on n, and state 3 on g. But the other, equally valid way would be to stay in state 0 the whole time, matching each letter to the [a-z] transition. Both ways obey the transition rules, but one results in acceptance, while the other results in rejection. The problem here is that state 0 allows for two different transitions on the symbol i. One is to stay in state 0 matching [a-z] and the other is to move to state 1 matching i. Moreover, there is no simple rule by which we can pick one path or another. If the input is sing, the right solution is to proceed immediately from state zero to state one on i. But if the input is singing, then we should stay in state zero for the firsting and proceed to state one for the seconding . An NFA can also have an (epsilon) transition, which represents the empty string. This transition can be taken without consuming any input symbols at all.</p><p>For example, we could represent the regular expression a*(ab|ac) with this NFA:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*nQ-xGP5OwiDc2jkAneksHw.png" /></figure><p><strong>Converting Regular Expressions to NFAs</strong></p><p>To convert a regular expression to a nondeterministic finite automaton, we can follow an algorithm given first by McNaughton and Yamada [5], and then by Ken Thompson [6]. We follow the same inductive definition of regular expression as given earlier. First, we define automata corresponding to the base cases of REs:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/609/1*P0LtdlGeqpYMsLJFz6s97g.png" /><figcaption>The NFA for any character a and he NFA for an epsilon transition is:</figcaption></figure><p>Now, suppose that we have already constructed NFAs for the regular expressions A and B, indicated below by rectangles. Both A and B have a single start state (on the left) and accepting state (on the right). If we write the concatenation of A and B as AB, then the corresponding NFA is simply A and B connected by a transition. The start state of A becomes the start state of the combination, and the accepting state of B becomes the accepting state of the combination:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/446/1*2mXaP6CVv2bO4SkAVsLnjA.png" /><figcaption>The NFA for the concatenation AB</figcaption></figure><p>In a similar fashion, the alternation of A and B written as A|B can be expressed as two automata joined by common starting and accepting nodes, all connected by transitions:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/485/1*KbwqKurnQC8Ejg5rL73bDg.png" /><figcaption>The NFA for the alternation A|B</figcaption></figure><p><strong>Converting NFAs to DFAs</strong></p><p>We can convert any NFA into an equivalent DFA using the technique of subset construction. The basic idea is to create a DFA such that each state in the DFA corresponds to multiple states in the NFA, according to the “many-worlds” interpretation.</p><p>Suppose that we begin with an NFA consisting of states N and start state N0. We wish to construct an equivalent DFA consisting of states D and start state D0. Each D state will correspond to multiple N states. First, we define a helper function known as the epsilon closure:</p><p>Epsilon closure−closure(n) is the set of NFA states reachable from NFA state n by zero or more transitions.</p><p>Now we define the subset construction algorithm. First, we create a start state D0 corresponding to the−closure(N0). Then, for each outgoing character c from the states in D0, we create a new state containing the epsilon closure of the states reachable by c.</p><h3>What is Syntax Analysis in Compiler Design?</h3><p>The 2d segment of the compiler is referred to as Syntax analysis. It is found within side the preceding chapters that the tokens are diagnosed through the lexical analyzer. But the syntax of the given declaration can’t be checked through the lexical analyzer due to the restrictions of the everyday expressions. The balancing tokens can’t be checked through everyday expressions. Thus the context-loose grammar (CFG), that is identified through push-down automata, is utilized by this segment.</p><p>CFG, on the alternative hand, is a superset of Regular Grammar, as depicted below:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/255/0*B7hqz8fND2S-148E" /></figure><p>Each Regular Grammar is context-loose, however a few issues exists which might be past the scope of Regular Grammar. The syntax of the programming languages is defined through the CFG.</p><h3>What is Context-Free Grammar (CFG)?</h3><p>A context-unfastened grammar has 4 components:</p><ul><li>A set of non-terminals (V). The syntactic variables that denote the set of strings are Non-terminals. The set of strings are described via way of means of the non-terminals, which assist in defining the grammar language.</li><li>A set of tokens, called terminal symbols (Σ). Terminals are the primary symbols from which strings are formed.</li><li>A set of productions (P). The manner wherein the terminals and non-terminal integrate to shape strings is detailed via way of means of the productions of a grammar. Each manufacturing includes a non-terminal referred to as the left aspect of the manufacturing, an arrow, and a chain of tokens and/or on- terminals, referred to as the proper aspect of the manufacturing.</li><li>One of the non-terminals is specified because the begin image (S); from wherein the manufacturing begins.</li><li>The begin image derives the strings via way of means of changing the non-terminal via way of means of the proper aspect of a manufacturing for that non-terminal.</li></ul><p>Example</p><p>For instance, The hassle of palindrome language is taken into consideration which the Regular Expression can’t describe. In the feel that L = w = wR isn’t always a normal language, however CFG can describe as follows:</p><p>G = ( V, Σ, P, S )</p><p>Where,</p><p>V = { Q, Z, N }</p><p>Σ = { 0, 1 }</p><p>P = { Q → Z | Q → N | Q → ℇ | Z → 0Q0 | N → 1Q1 }</p><p>S = { Q }​</p><p>This grammar describes palindrome language, such as: 1001, 11100111, 00100, 1010101, 11111, etc.</p><h3>What is a Syntax Analyzers in Compiler Design?</h3><p>The input is taken by the lexical analyzer as a token stream from the parser. The source code retrieved from the token stream is analyzed by the parser against the production rules to detect errors in the code, and the analysis tree is the result of this phase.</p><p>Parsing is used to derive strings using grammar production rules. Used to check the legality of a string. The compiler is used to check if the string is syntactically correct. The parser takes the input and builds the analysis tree.</p><p>There are two types of parsers :</p><ul><li>Top-down parsing Top-down parsing starts at the beginning with a start symbol and uses the analysis tree to derive the string.</li><li>BottomUp Parser Bottom Up parsing starts at the bottom of the string and goes down the parsing tree to reach the start symbol.</li></ul><h3>Design of Top-Down Parser</h3><p>For top-down parsing, a PDA has the following four types of transitions −</p><ul><li>Pop the non-terminal on the left hand side of the production at the top of the stack and push its right-hand side string.</li><li>If the top symbol of the stack matches with the input symbol being read, pop it.</li><li>Push the start symbol ‘S’ into the stack.</li><li>If the input string is fully read and the stack is empty, go to the final state ‘F’.</li></ul><h3>Example</h3><p>Design a top-down parser for the expression “x+y*z” for the grammar G with the following production rules −</p><p>P: S → S+X | X, X → X*Y | Y, Y → (S) | id</p><p><em>Solution</em></p><p>If the PDA is (Q, ∑, S, δ, q0, I, F), then the top-down parsing is −</p><p>(x+y*z, I) ⊢(x +y*z, SI) ⊢ (x+y*z, S+XI) ⊢(x+y*z, X+XI)</p><p>⊢(x+y*z, Y+X I) ⊢(x+y*z, x+XI) ⊢(+y*z, +XI) ⊢ (y*z, XI)</p><p>⊢(y*z, X*YI) ⊢(y*z, y*YI) ⊢(*z,*YI) ⊢(z, YI) ⊢(z, zI) ⊢(ε, I)</p><h3>Design of a Bottom-Up Parser</h3><p>For bottom-up parsing, a PDA has the following four types of transitions −</p><ul><li>Push the current input symbol into the stack.</li><li>Replace the right-hand side of a production at the top of the stack with its left-hand side.</li><li>If the top of the stack element matches with the current input symbol, pop it.</li><li>If the input string is fully read and only if the start symbol ‘S’ remains in the stack, pop it and go to the final state ‘F’.</li></ul><p>Pushdown Automata is a finite automaton with additional memory called stack that aids in the recognition of Context Free Languages.</p><p>A Pushdown Automata (PDA) can be defined as :</p><ul><li>Q is the set of states</li><li>∑is the set of input symbols</li><li>Γ is the set of pushdown symbols (which can be pushed and popped from stack)</li><li>q0 is the initial state</li><li>Z is the initial pushdown symbol (which is initially present in stack)</li><li>F is the set of final states</li><li>δ is a transition function which maps Q x {Σ ∪ ∈} x Γ into Q x Γ*. In a given state, PDA will read input symbol and stack symbol (top of the stack) and move to a new state and change the symbol of stack.</li></ul><p><strong>Instantaneous Description (ID)</strong></p><p>Instantaneous Description (ID) is a colloquial term that describes how a PDA “computes” an input text and decides whether it should be accepted or rejected.</p><p>A ID is a triple (q, w, α), where:</p><p>1. q is the current state.</p><p>2. w is the remaining input.</p><p>3.α is the stack contents, top at the left.</p><p><strong>Turnstile notation</strong></p><p>⊢ sign is called a “turnstile notation” and represents</p><p>one move.</p><p>⊢* sign represents a sequence of moves.</p><p>Eg- (p, b, T) ⊢ (q, w, α)</p><p>This implies that while taking a transition from state p to state q, the input symbol ‘b’ is consumed, and the top of the stack ‘T’ is replaced by a new string ‘α’</p><p><strong>Example :</strong> Define the pushdown automata for language {anbn | n &gt; 0}</p><p><strong>Solution : </strong>M = where Q = { q0, q1 } and Σ = { a, b } and Γ = { A, Z } and δ is given by :</p><p>δ( q0, a, Z ) = { ( q0, AZ ) }</p><p>δ( q0, a, A) = { ( q0, AA ) }</p><p>δ( q0, b, A) = { ( q1, ∈) }</p><p>δ( q1, b, A) = { ( q1, ∈) }</p><p>δ( q1, ∈, Z) = { ( q1, ∈) }</p><p>Let us see how this automata works for aaabbb.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/626/0*X9ASMurmWqHhzf3D" /></figure><p><strong>From the above image, i</strong>nitially, the automaton state is q0, the symbol on the stack is Z, and the input is aaaabbb, as shown on the first line. Reading `a ` (shown in bold on the second line) leaves state q0 and pushes symbol A onto the stack. The next `a ` (shown on line 3 ) pushes another A symbol onto the stack. After reading 3 a, the stack is AAAZ and A is on top. After reading `b ` (as shown on line 5), A opens, goes to state q1, and the stack goes to AAZ. If all b `are read, the state is q1 and the stack is Z. Z is displayed on the 8th line at the input symbol `` and Z on the stack, and the stack is empty. This type of acceptance is called an empty stack acceptance.</p><p><strong>Push Down Automata State Diagram:</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/300/0*mlIxpCQNN8X6Vb20" /></figure><p><strong><em>State Diagram for above Push Down Automata</em></strong></p><p><strong>Note :</strong></p><ul><li>The above pushdown automaton is deterministic in nature due to the fact there may be handiest one pass from a country on an enter image and stack image.</li><li>The non-deterministic pushdown automata could have multiple pass from a country on an enter image and stack image.</li><li>It isn’t always constantly feasible to transform non-deterministic pushdown automata to deterministic pushdown automata.</li><li>The expressive strength of non-deterministic PDA is extra compared to expressive deterministic PDA as a few languages are common through NPDA however now no longer through deterministic PDA as a way to be mentioned within side the subsequent article.</li><li>The pushdown automata can both be applied the usage of popularity through empty stack or popularity through very last country and one may be transformed to another.</li></ul><p><strong>Summary</strong></p><p>An automaton, for our purposes, is a set of rules called transitions that define a language by describing how it can recognize strings in that language; examples including finite automata, pushdown automata, and Turing machines. Regular expressions are a special notation for representing regular languages. They are similar to regular grammars and finite automata in that they define a regular language. The first task of the compiler is to process the input and determine if the input is valid. To do this, the compiler checks if the input is a valid string in the language of all valid inputs. This language is defined by the grammar and the compiler implements the automaton . The computer “recognizes” the state machine in the sense that it behaves very well to do what the diagram suggests and to do it the way the figure suggests.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=78875a53ef46" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[CRYPTOGRAPHY AND ECONOMY]]></title>
            <link>https://aarushi-bhate19.medium.com/cryptography-and-economy-7eda38b82f8d?source=rss-d68fd1b09ac6------2</link>
            <guid isPermaLink="false">https://medium.com/p/7eda38b82f8d</guid>
            <dc:creator><![CDATA[Aarushi Bhate]]></dc:creator>
            <pubDate>Thu, 06 Jan 2022 18:39:06 GMT</pubDate>
            <atom:updated>2022-01-21T03:55:38.615Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Qk4hbwYJ2WpLr1TYpPyZaQ.jpeg" /></figure><h3>Elon Musk may be a billionaire entrepreneur. “Paper money goes away,” someone once stated. “Crypto[currency] may be a lot superior means to transmit value than bits of paper, without a doubt.’’</h3><p>It’s due to this history that Musk had no choice but to become engaged — if grudgingly — with cryptocurrencies, a technology that allowed for online payments. We all know Elon Musk’s tweets about various cryptocurrencies . Using Twitter, he has established a large following within the crypto sector.</p><p>Beginners and investors in Bitcoin alike are unaware of the basics of cryptocurrency, including its benefits, drawbacks, and market influence. The principle of cryptocurrency is simple: throughout the early stages of civilization, people used barter, then paper or coinage, and now, in the modern day, cryptocurrency is used to trade money digitally. The world has not yet converted to a transferable digital asset or digital form of money, but it will eventually replace all forms of physical money transactions. Cryptocurrency, according to Kaspersky, a Russian multinational cybersecurity and anti-virus firm, is a digital payment system that does not rely on banks to validate transactions. It’s a peer-to-peer payment system which allows anybody from anywhere to send or receive capital. Cryptocurrency payments exist solely as digital entries to an online database identifying particular transactions, rather than as real money transported around and traded throughout the world. The transactions are recorded on a public ledger whenever you transfer bitcoin funds.Cryptocurrencies can also be stored using the digital Wallets.</p><blockquote>USES AND TYPES OF CRYPTOCURRENCY</blockquote><h4><strong>Over the years, Bitcoin has grown in popularity. Although it’s not completely replacing institutionalized currency, it’s used by an outsized number of people everywhere on the planet .</strong></h4><p>The use of cryptocurrency is mainly for the following:</p><ul><li>As the mode of payment</li><li>Investment</li></ul><h4>Are cryptocurrencies a good investment?</h4><p>Cryptocurrencies might increase in value, but many investors regard them as speculative investments rather than long-term investments. What is the explanation behind this? Cryptocurrencies, like actual currencies, create no revenue, thus in order for you to benefit, someone else would have to pay more for the currency than you did.</p><p>That all collectively is known as the GREATER FOOL investing hypothesis. In contrast, a well-managed firm improves its value over time by increasing the operation’s profitability and income.</p><p>There are many individuals who believe that cryptocurrencies such as Bitcoin will be extensively adopted in the future. It is important to remind them that a currency must be stable in order for merchants and customers to understand its true worth. Altcoins and bitcoin and someother cryptocurrencies have been fluctuating but finally were stable for much of their existence. Bitcoin, for example, was on the cusp of surpassing $20,000 in December 2017, but it fell to roughly $3,200 a year later. in December 2020, it again reached its all time high..</p><p>This variation in pricing is an issue. People are less likely to spend and circulate bitcoins today if they may be worth a lot more later, making the currency less feasible. Why spend a bitcoin when it may be worth a lot more next year?</p><h3><strong><em>Cryptography and Economics</em></strong></h3><p>The study of economic interaction in hostile contexts is referred to as crypto economics. The fundamental problem is that in decentralized P2P systems that don’t cede control to a single entity, bad actors seeking to disrupt the system must be expected. Crypto Economic techniques integrate encryption with economics to create resilient decentralized peer-to-peer networks that persist over time despite attempts to destroy them. The encryption that underpins these systems ensures that P2P communication inside the networks is safe, and hence economics incentivizes all players to contribute to the network in order for it to grow over time.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*pOi1shF4swruQOkj" /></figure><p><strong>MARKET CAPITALIZATION</strong></p><p><strong>Following below are the 10 of the largest trading cryptocurrencies in terms of market capitalization as tracked by CoinMarketCap, a cryptocurrency data and analytics provider.</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*XqAaRlxcd9fcjDpY" /><figcaption>Market capitalization as tracked by CoinMarketCap</figcaption></figure><h3><strong>Dark Side of Cryptocurrency</strong></h3><p>Can we see the evil side of blockchain technology and cryptocurrencies, despite our fascination with them? Is this technology considered to be safe? You may have heard about Kleptography, which is the bad side of cryptocurrencies, as well as a Cryptography recorder.</p><p>Data is frequently stolen using a kleptographic assault. A developer can establish a backdoor for himself within the technology by using asymmetric encryption. Manipulation of the key creation process makes such a thing conceivable. The malevolent developer can include a backdoor in the cryptosystem so that he can have access to the private key without the knowledge of anybody else, in this case a third party. It may appear to be a little issue, but it is not.</p><p>The “research of stealing information safely and subliminally” is referred to as kleptography. A kleptographic attack is one in which a rogue developer implements a cryptographic back door using asymmetric encryption. The back door in issue isn’t a new channel of communication to the planet outside the cryptosystem, nor does it necessitate the transmission of additional data, therefore cryptography is employed against cryptography in this way. Instead, the back door is included directly into the intended communication. As a result, kleptography may be considered a subset of crypto virology, or the use of cryptography in malware. A kleptographic attack, on the other hand, is directed at the exact environment of a cryptosystem, rather than any generic type of program.</p><p>A hypothetical kleptographic assault is depicted in the following example. A recorder creates asymmetric key pairs, one of which may be a private key and the other a public key. To prevent inappropriate use and duplication, the private key used in decryption and digital signature production should be kept alone inside the recorder. The universal public key, on the other hand, is frequently freely given. Nobody, it is often assumed, can extract the private key from the public key — or can they?</p><p>In reality, if the key generation process has been altered in a certain way, such a derivation is achievable. A cryptographic back door might be built within the cryptosystem’s development process, allowing an attacker to obtain the private key without garnering the attention of a third party. This is frequently possible since the created public keys will not be visible, and no unexpected communication or issues will occur while utilizing the cryptographic feature. It has a huge influence. The attacker can forge signatures and decrypt secret data using a copy of the private key, despite the fact that the cryptographic keys were created in a sealed recorder with no unauthorized access to the contents.</p><p>Instead of using a really random function, a simpler variant of this attack might control the random number generator within the cryptosystem (see Figure 1), causing the key creation process to utilize a pseudo-random number generator with a seed known to the attacker. The attacker might create a clone of the key key outside the recorder by knowing the prime numbers created within the cryptosystem.</p><p>Reverse engineering may be able to uncover such manipulations if they are not prohibited by a security measure, such as those found in specialized cryptographic hardware. A reverse engineer might derive the private key outside of the recorder since the seed of the pseudo-random number generator is fixed within the ASCII text file. From the attacker’s standpoint, having exclusive access to the attack technique is desired, which may not be the case. Reverse engineers may be prevented from making this sort of finding by more sophisticated kleptographic assaults.</p><p><strong>Beware of the dark side</strong></p><p>With all of its advantages, such as the ability to conduct transactions more easily and quickly with lower or no costs, and the promise to improve financial inclusion for the unbanked and underbanked, crypto does have a dark side.</p><p>In particular, Bitcoin is well-known for being used for payment and trade by criminals and terrorists. It’s unregulated, provides a high level of anonymity, is simple to use, and allows bad actors to more easily circumvent regulatory restrictions and evade detection by authorities.</p><p>Even as cryptocurrencies gain popularity for legal transactions and customers, they are also creating a large amount of data that is helpful for criminals and offenders.</p><p>According to a recent analysis by Chainalysis, illegal cryptocurrency transactions in 2020 will be worth $10 billion. Although unlawful crypto transactions account for a small percentage of overall global transactions, $10 billion in illegal activity cannot be overlooked.</p><p>This is especially true when it comes to the types of crimes that got the most bitcoin funding between 2017 and 2020, such as supporting terrorists, buying and selling narcotics and weapons on the dark web, frauds, ransomware, child abuse materials, and domestic extremism.</p><p>Furthermore, crypto is the preferred method of concealment and evasion for criminals and state actors attempting to avoid international commerce restrictions.</p><p>Without going into detail, we’ll see why law enforcement and security agencies consider bitcoin to be a rising concern. For example, privacy-enhancing crypto wallets like Wasabi and Samurai are listed as a “high danger” by Europol in their recent IOCTA — Internet Organised Crime Threat Assessment, which notes that “privacy coins may provide a considerable hurdle to enforcement operations.”</p><p>In a late 2020 report on its cryptocurrency enforcement framework, the US Department of Justice Cyber-Digital Task Force addresses “the emerging threats posed by rapidly developing cryptocurrencies that malicious cyber actors frequently use,” noting that “an aggressive but well-informed approach toward abusive cryptocurrency activity” should be taken.</p><p><strong>Regulating Cryptocurrency in India</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*MHeIOJ3Li-L3-SOx" /><figcaption>Source: thedailyguardian.com</figcaption></figure><p>There is currently no rule or prohibition in place in the nation regarding the use of cryptocurrencies.</p><p>The Cryptocurrency and Regulation of Official Digital Currency Bill, 2021, is set to be tabled in Parliament during the Winter Session, which starts on November 29. Its mission is to “provide a conducive environment for the formation of the official digital currency to be issued by the Federal Reserve Bank of India.”</p><p>The Prime Minister of India recently presided over a meeting on the administration of the cryptocurrency industry. He advocated for adopting innovative and forward-thinking initiatives, citing the uncontrolled structure of the crypto sector.</p><p>In India, there is currently no legislation that regulates cryptocurrency. Cryptocurrency ownership is still legal in India. The Supreme Court of India overturned the Federal Reserve Bank of India’s restriction on crypto currency trading in India in 2020 (RBI).</p><p>China has declared all cryptocurrency transactions unlawful, thereby outlawing them entirely, but El Salvador has allowed Bitcoin to be used as a form of payment.</p><p><strong>Associated Concerns with cryptocurrencies</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*kZdeG0nz7RQQCLJc" /><figcaption>History of Money (Source: hackernoon.com)</figcaption></figure><ul><li><strong>Bombardment of Advertisement:</strong> The crypto market is viewed as a way to make rapid money. As a result, there is a barrage of advertising, both online and offline, aimed at luring consumers into trading during this market.</li><li>However, there are worries that “over-promising” and “non-transparent advertising” are being used to deceive the youth.</li><li><strong>Counterproductive Utility:</strong> Unregulated crypto markets may be used for concealment and terror financing, which is a counterproductive use of the technology.</li><li><strong>Cryptocurrencies are Extremely Volatile:</strong> Bitcoin has risen from a low of USD 40,000 to a high of USD 65,000. (between January to April 2021).</li><li>Then, in May 2021, it plummeted, and it remained below USD 30,000 for the entire month of June.</li><li><strong>Macroeconomic and Financial Stability:</strong> According to a number of cryptocurrency exchanges, Indians have invested over Rs 6,00,000 crore in cryptocurrency assets.</li><li>The level of Indian retail investors’ investment involvement in this unregulated asset class is a threat to macroeconomic and financial stability.</li><li><strong>Stock Market Issues:</strong> The Securities and Exchange Board of India (SEBI) has stated that it has no authority over the “clearing and settlement” of crypto currencies and that it cannot provide counterparty guarantees as it does with completed stocks.</li><li>Furthermore, it is unclear if bitcoin is a money, a commodity, or a security.</li></ul><p><strong>Effect on Cryptocurrency’s economic value upon regulation of assets</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/880/0*hjtILnEfEXAkBKyv" /><figcaption>Source: financemagnates.com</figcaption></figure><p>Cryptocurrencies basically refer to digital currencies that are used in electronic payment systems without the intervention of a government or a third party like a bank. Users of the system, on the other hand, utilize predefined protocols to validate payments. Cryptocurrencies have flourished since the development of the first cryptocurrency, Bitcoin, in 2008. They have seen a quick surge in value followed by a sharp decline in value in recent years. According to one estimate, there were more than 5,100 distinct cryptocurrencies totaling $231 billion as of March 2020. Cryptocurrencies have attracted the attention of the general public and policymakers because of their quick rise and volatility.</p><p>Analyzing data regarding particular qualities and, as a result, the usage of cryptocurrencies would be useful in determining how effectively cryptocurrency performs as a form of alternate payment and, therefore, its future prospects as money. Conducting such an analysis, however, is currently difficult. Because of the decentralized nature of cryptocurrencies, locating reliable sources of industry data is challenging. Furthermore, the current emergence of cryptocurrencies adds to the difficulty of doing industry-wide analyses. For example, as of March 10, 2020, one industry group claimed to be tracking 5,170 cryptocurrencies trading at prices indicating a total market worth of $231 billion.</p><p>Due to these difficulties, a comprehensive quantitative chemical examination of the whole cryptocurrency business is outside the scope of this paper. Instead, the study uses Bitcoin as an example — the first and best-known cryptocurrency, whose total value amounts for almost two-thirds of the whole cryptocurrency market. Recent patterns in Bitcoin pricing, value in circulation, and quantity of transactions may provide insight into how effectively cryptocurrencies as a payment system are working in general. The quick rise in the value of cryptocurrencies in 2017 is believed to have contributed to the subsequent surge in public interest in digital currencies. The value of a Bitcoin on an exchange was at $993.43 at the start of 2017, but it skyrocketed throughout the year, peaking at over $19,650 in December 2017, an almost 1,880 percent gain from January 2017.</p><p>However, in just two months, the value had plummeted by 65 percent to $6,905. The value of Bitcoin has been fluctuating since then. Similar price oscillations have been seen in other prominent cryptocurrencies such as Ether and Litecoin. As of March 9, 2020, 1 Bitcoin was worth $7,945 and there were roughly 18.3 million Bitcoins in circulation, putting the total value of all Bitcoins in circulation at $144 billion.</p><p><strong>Conclusion</strong></p><p>Due to outstanding uncertainties about cryptocurrencies’ capacity to effectively and efficiently perform the functions of currency and disrupt existing money and payment systems, their future role and value remain very unknown. Cryptocurrencies, consistent with proponents, will become a widely used payment method, providing increased economic efficiency, privacy, and independence from centralized institutions and authorities, also as increased economic efficiency, privacy, and independence from centralized institutions and authorities. Skeptics argue that cryptocurrencies don’t properly execute the functions of cash and can not be a valued, widely utilized sort of money within the future, citing technological problems and barriers to widespread adoption. Policymakers will likely be confronted with a spread of issues associated with cryptocurrency as technological advancements and economic conditions unfold, including concerns about its alleged facilitation of crime, the adequacy of consumer protections for those engaged in cryptocurrency transactions, the scope of appropriate industry regulation, and cryptocurrency’s potential impact on monetary policy.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7eda38b82f8d" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Application Layer Protocols]]></title>
            <link>https://aarushi-bhate19.medium.com/application-layer-protocols-8f47ba6dc456?source=rss-d68fd1b09ac6------2</link>
            <guid isPermaLink="false">https://medium.com/p/8f47ba6dc456</guid>
            <dc:creator><![CDATA[Aarushi Bhate]]></dc:creator>
            <pubDate>Mon, 17 May 2021 04:39:06 GMT</pubDate>
            <atom:updated>2021-05-17T10:11:47.368Z</atom:updated>
            <content:encoded><![CDATA[<h3>APPLICATION LAYER PROTOCOLS</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/837/1*O_a0rTDiLT45PK2Xukr3xA.png" /></figure><h3><strong>THE COMMUNICATION BARRIER AND THE EMERGENCE OF THE COMMUNICATION MODELS</strong></h3><p>In the initial days of computer networking, a set of design standards was required where equipment manufacturers could communicate with each other. The manufacturers created their own networking models to sell them under their own trade name. The biggest problem with those models was that the communication was limited to the devices of only that company which used to manufacture it. For instance, a computer manufactured by IBM was able to communicate only with the computer or networking device that was also manufactured by IBM. This situation was not profitable for both manufacturers and users. To break through this barrier, leading hardware manufacturers agreed to use or support a vendor neutral networking model along with their own proprietary networking model in devices. To create a vendor neutral networking model, two major efforts were made. The first one was made by ISO — OSI Model, and the second one was made by DoD — TCP/IP model.</p><p><strong>THE OSI MODEL AND THE TCP/IP REFERENCE MODEL</strong></p><p>In the networking world, the OSI stands for Open Systems Interconnection Model which is also known as the OSI Model. The OSI Model is a logical and conceptual model used to describe the functions of a networking system which enables diverse communication systems to communicate using standard protocols. In simple words, the OSI provides a standard for different computer systems to be able to communicate with each other. The model being a layered server architecture system, each layer is defined according to a specific function to perform. The seven layers of the OSI model is a somewhat idealized view of how networking protocols should work. It provides a convenient if not completely accurate conceptual picture of how networking works. Given below are the different layers of the OSI model in the table.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/784/1*lSqLqeSlNnMIht8LO073VA.png" /><figcaption>The table above consists of different layers of OSI Model and its description.</figcaption></figure><p>To get the conceptual picture of how <strong>protocol</strong> stack works in networking, the TCP/IP model came into existence. The TCP/IP reference model is a standard network model and communication protocol stack used on the Internet and on most other computer networks. It is a layered model which is similar to the layers of the OSI model. The OSI model is an idealized networking model, whereas the TCP/IP model is a practical implementation. As mentioned earlier, the <strong>OSI model uses seven, the TCP/IP stack uses five layers</strong>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/949/1*eXOzfmDT--gmFduhKyOMaQ.png" /><figcaption>TCP/IP Model Vs OSI Model</figcaption></figure><h3><strong>THE APPLICATION LAYER</strong></h3><p>The <strong>highest layer</strong>, the application layer, is the <strong>seventh layer</strong> of OSI model and fifth layer of TCP/IP Model. The Application layer in the TCP/IP model has approximately the same functionality as the upper three layers(Application, Presentation, and Session layer) of the OSI model.</p><p>This layer deals with the techniques that application programs use to communicate with the network. It is <strong>closest to the end user</strong>, both the application layer and the user interacts directly with the software application. Application programs (such as Microsoft Office or QuickBooks) aren’t a part of the application layer. Rather, the application layer represents the programming interfaces that application programs use to request network services.</p><p>The applications use services provided by the lower layers, especially the transport layer which provides reliable or unreliable <em>pipes</em> to other processes.</p><p>Application layer is the layer in which all application protocols operate, such as:</p><ul><li>HTTP : It stands for Hypertext Transfer Protocol. The foundation of any data exchange on the Web.</li><li>FTP : It stands for file transfer protocol. It lets us transfer files.</li><li>DNS : It stands for Domain Name System. A DNS service must translate a domain name into the corresponding IP address.</li><li>TELNET : It stands for <strong>TEL</strong>ecommunications <strong>NET</strong>work. Helps in terminal emulation. Allows Telnet clients to access the resources of the Telnet server.</li><li>SMTP : It stands for Simple Mail Transfer Protocol. Using a process called “store and forward,” SMTP moves your email on and across networks.</li><li>LPD : It stands for Line Printer Daemon. It is designed for printer sharing.</li></ul><p>Let’s dive into a few of the most widely used application layer protocols…</p><h3><strong>APPLICATION LAYER PROTOCOLS</strong></h3><p><strong>HTTP (<em>Hypertext Transfer Protocol)</em></strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/764/1*9O5biIzks9nStquf39aoCQ.png" /></figure><p>Designed in the early 1990s, HTTP is an extensible protocol which has evolved over time. It is perhaps the most popular application protocol used on the Internet. It allows the fetching of resources, such as HTML documents. It is the foundation of any data exchange on the Web. An HTTP request is the way internet communications platforms such as web browsers ask for the information they need to load a website.</p><p>HTTP is a client-server protocol, which means requests are initiated by the recipient, usually the Web browser. An HTTP client sends a request message to an HTTP server. The server, in turn, returns a response message. In other words, HTTP is a pull protocol, the client pulls information from the server. It also has 3-digit status codes that are used to indicate whether an HTTP request has been successfully completed. Between the client and the server there are numerous entities, collectively called proxies, which perform different operations and act as gateways or caches. It is also a stateless protocol. In other words, the current request does not know what has been done in the previous requests.</p><p>An HTTP method indicates the action that the HTTP request expects from the queried server. For example, two of the most common HTTP methods are ‘GET’ and ‘POST’. A ‘GET’ request expects information back in return, while a ‘POST’ request typically indicates that the client is submitting information to the web server, such as form information.</p><p>The problem with the regular HTTP protocol is that the information that flows from server to browser is not encrypted, which means it can be easily stolen. Therefore, HTTPS — <em>Hypertext Transfer Protocol Secure </em><strong><em>-</em></strong>a secure version of <strong>HTTP</strong> was developed to overcome this security concern. It uses an SSL (secure sockets layer) certificate, thereby protecting potentially sensitive information. HTTPS represents the future of the web by making the internet safe for users and website owners.</p><p><strong>FTP</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/740/1*Z6LmVpUIEzeLUjiLPPjibA.png" /></figure><p>The first FTP standard was RFC 114, published in April 1971. This standard defined the basic commands of the protocol and the formal means by which devices communicate using it.</p><p>FTP was designed to allow the efficient transfer of files between any two devices on a TCP/IP internetwork. It automatically takes care of the details of how files are moved and provides a rich command syntax to allow various supporting file operations to be performed.</p><p>The FTP model is designed around two logical channels of communication between the server and user FTP processes, control connection and data connection. Control connection is the main logical TCP connection that is created when an FTP session is established. It is maintained throughout the FTP session and is used only for passing control information, such as FTP commands and replies. Each time that data is sent from the server to the client or vice-versa, a distinct TCP data connection is established between them. Data is transferred over this connection. When the file transfer is complete, the connection is terminated.</p><p>FTP finds application in many day-to-day business operations that span business-to-business and peer-to-peer data transfer use cases. Since the time that it was published, a number of other standards have been published that define extensions to FTP, better security measures and other features, and it remains, with several generations of enhancements, one of the most popular protocols used today.</p><p><strong>DNS</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/772/1*iD1Ra9VBDmF7h5W8iZ6BVg.png" /></figure><p>The idea of mapping human-readable hostnames to numerical addresses originated in the 1970s, with ARPANET, the predecessor of the modern internet. The Domain Network System (DNS) protocol helps Internet users and network devices discover websites using human-readable hostnames, instead of numeric IP addresses.</p><p>There are two key components that resolve DNS requests by clients: a DNS resolver and a DNS name server. The resolver is a server designed to receive DNS queries from web browsers and other applications or network devices. It receives a hostname, and is responsible for tracking down the IP address for that hostname. The authoritative name server is the last stop in a DNS query. It holds the DNS Master File for the DNS zone it manages, which contains the trusted, correct resource records for all domains in the zone.</p><p>DNS can be more than just a routing mechanism connecting hostnames with IPs. Advanced DNS solutions leverage the DNS infrastructure for new use cases. These capabilities are made possible by next-generation <a href="https://ns1.com/products/managed-dns">managed DNS</a> servers that are able to intelligently route and filter traffic.</p><p><strong>Thank you readers for your time!</strong></p><p><strong>Comment, like and share this insightful blog on Application Layer Protocols to people who are in thirst for knowledge on Networking!</strong></p><p><strong><em>Authors</em></strong></p><p><em>Aarushi Bhate</em></p><p><em>Arya Deshpande</em></p><p><em>Anjali Asolkar</em></p><p><em>Badrisrivaishnavi Yeluri</em></p><p><em>Rutuj Bafna</em></p><p><strong><em>References</em></strong></p><p>[1] <a href="https://spectrum.ieee.org/tech-history/cyberspace/osi-the-internet-that-wasnt">https://spectrum.ieee.org/tech-history/cyberspace/osi-the-internet-that-wasnt</a></p><p>[2] <a href="http://www.steves-internet-guide.com/internet-protocol-suite-explained/">http://www.steves-internet-guide.com/internet-protocol-suite-explained/</a></p><p>[3] <a href="https://blog.finjan.com/application-layer-security-and-the-osi-model/">https://blog.finjan.com/application-layer-security-and-the-osi-model/</a></p><p>[4] <a href="https://gradeup.co/application-layer-protocols-dns-smtp-pop-ftp-http-i-ba1194bd-c5ab-11e5-9dcb-5849de73f8e1">https://gradeup.co/application-layer-protocols-dns-smtp-pop-ftp-http-i-ba1194bd-c5ab-11e5-9dcb-5849de73f8e1</a></p><p>[5]<a href="https://www3.ntu.edu.sg/home/ehchua/programming/webprogramming/HTTP_Basics.html">https://www3.ntu.edu.sg/home/ehchua/programming/webprogramming/HTTP_Basics.html</a></p><p>[6] <a href="http://www.tcpipguide.com/free/t_toc.htm">http://www.tcpipguide.com/free/t_toc.htm</a></p><p>[7] <a href="https://ns1.com/resources/dns-protocol">https://ns1.com/resources/dns-protocol</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=8f47ba6dc456" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>