answersLogoWhite

0

DBYN:If in any derivation we replace the variables starting from the left side then it is called leftmost derivation in automata.let us take an example:

consider the following production set--

S->aBC

B->cca

C->aB

Then the leftmost derivation is as below:

S=>aBC

=>accaC[replacing variable B by cca]

=>accaaB[replacing variable C by aB]

=>accaacca[replacing variable B by cca]

first time i don't have to logged in,i just click on answer it & share as much as i know,but in the 2nd time i have to logged in in order to improve the answer.Anyone knows why is that?

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is the left most derivation in automata?

A leftmost derivation in automata and formal language theory refers to the process of deriving a string from a grammar by always replacing the leftmost non-terminal symbol first. This approach systematically applies production rules to generate strings in a way that prioritizes the leftmost non-terminal, progressing through the string until only terminal symbols remain. Leftmost derivations are crucial for understanding parsing techniques and the structure of context-free grammars.


Can you provide an example of a leftmost derivation parse tree for the keyword "algorithm"?

A leftmost derivation parse tree for the keyword "algorithm" would start with the initial symbol S and then branch out to the terminals and non-terminals in a leftmost manner, showing the step-by-step derivation of the word "algorithm".


What is the difference between leftmost and rightmost derivation in the context of parsing algorithms?

In parsing algorithms, the difference between leftmost and rightmost derivation lies in the order in which non-terminal symbols are replaced with terminal or non-terminal symbols. In a leftmost derivation, the leftmost non-terminal symbol is always replaced first, while in a rightmost derivation, the rightmost non-terminal symbol is replaced first. This affects the structure and order of the resulting parse tree.


A top down parser generates?

a top down parser generates a leftmost derivation


When was Automata released?

Automata was released on 12/31/2014.


What was the Production Budget for Automata?

The Production Budget for Automata was $15,000,000.


When did Automata UK end?

Automata UK ended in 1985.


Is the main purpose of using Automata?

 Is the main purpose of using Automata?


What is finite automata you-moves?

Finite automata with ε-moves, also known as epsilon transitions, are a type of finite state machine that allows transitions between states without consuming any input symbols. This means that the automaton can move from one state to another spontaneously, enabling it to represent a broader range of languages than standard finite automata. Epsilon transitions can simplify the design of automata, particularly when converting from nondeterministic finite automata (NFA) to deterministic finite automata (DFA) or when constructing automata for regular expressions.


Who invented the automata?

the greeks


What is the difference between automata and automaton?

automata is simply plural of automaton. shantanu sharma SCRIET 2008-2012


What is full form of DFA and NFA?

DFA - deterministic finite automata NFA - non-deterministic finite automata