The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote
Once the parser makes the list of legitimate tokens available to the error recovery routine then this routine can decide whether a remaining input’s prefix matches one of these tokens closely enough to be treated as that token. This helps the lexical analyzer.
asked in Compiler Design by Active (3.6k points) | 117 views

Please log in or register to answer this question.

Related questions

+3 votes
3 answers
asked Dec 15, 2016 in Compiler Design by prasitamukherjee Active (2.1k points) | 1.8k views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

47,139 questions
51,389 answers
66,701 users