answersLogoWhite

0


Best Answer

The output of an assembler is a part or all of a product. An assembler can work in a variety of manufacturing operations with the right training.

User Avatar

Wiki User

9y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

12y ago

The output of two-pass assembler is object code (and assembly listing).

The output of one-pass or three-pass assembler is object code (and assembly listing).

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the output of the parser from a compiler?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What is the difference between interpreter and parser and compiler?

in my personal point of view i would say a parser is more like "one-directional" "automatic" vs. an interpreter, the interpreter has more "intelligence"


Why is object code necessary?

Object code is necessary, because object code is the actual instructions, or machine language, that the computer executes. Object code is the output of the compiler, as it translates the higher level language into the machine language. It is also the output of the linker, as it combines object code modules from the compiler output and the various libraries in its process of building a fully linked load module.


What is the role of data structure in compiler design?

The role of the data structure in compiler designer is to take an input of a program written in another language and produce an output in another language. It also performs error detection.


What are structured grammars and languages generated by a grammar?

Structured or formal grammars are a method of describing a computer language in another meta-language, that if the grammar. For example, you could use EBNF to describe the grammar for the language Pascal. The meta-language, the language in which the grammar is expressed, varies with the tools in use.Structured grammars are typically used to implement programming languages, but are also commonly used to create parsers for meta-languages such as HTML or XML, for command oriented streams, or for complex protocols (such as HTTP).This formal grammar definition acts as input to a parser generator. Parser generators are also compiler generators or compiler compilers, but these tools never generate a compiler. Instead, they generate lexical analyzers and parser tools, typically resulting in an abstract syntax tree (semantic node tree) in some form.A lexical analyzer is the tool that digests the input in the final language (e.g. Pascal), and decides on each fragment (token) what it is: a keyword, a number, etc. The parser generator folds the stream of tokens into semantic nodes (an expression, a variable definition, etc).At that point, the input (the Pascal program in this example) is known to be syntactically correct. The next stages include semantic analysis (does it make sense and what does it mean?), code generation and code optimization.The most famous (and infamous) representative is the pair of lex and yacc. Lex generates a lexical analyzer, yacc (short for Yet Another Compiler Compiler) generates a parser. Lex and Yacc's more modern successors are Flex and Bison, other popular tools include ANTLR. Other tools are available.


What is lexical analysis?

A compiler is usually divided into different phases. The input to the compiler is the source program and the output is a target program. Lexical analyzer is the first phase of a compiler which gets source program as input. It scans the source program from left to right and produces tokens as output. A token can be seen as a sequence of characters having a collective meaning. Lexical analyzer also called by names like scanner, linear analyzer etc.

Related questions

What is the difference between interpreter and parser and compiler?

in my personal point of view i would say a parser is more like "one-directional" "automatic" vs. an interpreter, the interpreter has more "intelligence"


What is the output of a compiler?

A compiler accepts computer instructions in a language people understand and converts them into a language computers understand.


Is it possible to inherit structure in c?

If a C compiler is available, then so is a C++ compiler - just use one that produces C as its output.


Where can you find an assembly program compiler and editor for the TI 84 calculator?

There is a TI asm manual with links on ticalc.org. But before you try that, Google "Axe Parser". Its not as good as it looks-- its better!


What is finite Automata-compiler design?

single possible output for a given input


What is the role of parser in compiler design?

· In the compiler model, the parser obtains a string of tokens from the lexical analyser, and verifies that the string can be generated by the grammar for the source language.· The parser returns any syntax error for the source language.· There are three general types' parsers for grammars.· Universal parsing methods such as the Cocke-Younger-Kasami algorithm andEarley's algorithm can parse any grammar. These methods are too inefficient to use in production compilers.· The methods commonly used in compilers are classified as either top-down parsing or bottom-up parsing.· Top-down parsers build parse trees from the top (root) to the bottom (leaves).· Bottom-up parsers build parse trees from the leaves and work up to the root.· In both case input to the parser is scanned from left to right, one symbol at a time.· The output of the parser is some representation of the parse tree for the stream of tokens.· There are number of tasks that might be conducted during parsing. Such as;o Collecting information about various tokens into the symbol table.o Performing type checking and other kinds of semantic analysis.o Generating intermediate code.


What is the role of a parser in compiler design?

· In the compiler model, the parser obtains a string of tokens from the lexical analyser, and verifies that the string can be generated by the grammar for the source language.· The parser returns any syntax error for the source language.· There are three general types' parsers for grammars.· Universal parsing methods such as the Cocke-Younger-Kasami algorithm andEarley's algorithm can parse any grammar. These methods are too inefficient to use in production compilers.· The methods commonly used in compilers are classified as either top-down parsing or bottom-up parsing.· Top-down parsers build parse trees from the top (root) to the bottom (leaves).· Bottom-up parsers build parse trees from the leaves and work up to the root.· In both case input to the parser is scanned from left to right, one symbol at a time.· The output of the parser is some representation of the parse tree for the stream of tokens.· There are number of tasks that might be conducted during parsing. Such as;o Collecting information about various tokens into the symbol table.o Performing type checking and other kinds of semantic analysis.o Generating intermediate code.


What is a parser?

Parser is a portion of the computer progam which carry out parsing process.


What are the applications of the computer program Yacc?

YACC, which stands for Yet Another Compiler Compiler, is considered a parser generator. This family of computer programs is used to decipher source code in programming. This type of program is used with almost all computer programs, but YACC has mostly been replaced by more recent programs.


When was Pdf-parser created?

Pdf-parser was created on 2008-05-02.


A top down parser generates?

a top down parser generates a leftmost derivation


How to design a Compiler?

This is a fairly complex answer, but it basically boils down to a few oversimplified steps. First, design a language, or find the specifications for a language you would like to use. Second, design a lexical parser that can interpret the "tokens" that you designed in your language. Third, design a compiler/linker that will assemble the tokens into binary code, and link them with the appropriate libraries. Your exact steps will vary depending on the operating system you are using, the compiler you have available, etc.