search
Log In
1 vote
167 views
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.
in Compiler Design 167 views

Please log in or register to answer this question.

Related questions

1 vote
2 answers
1
106 views
HI i am trying to understand what author is trying to explain in the below para. However i understood the meaning of Theta(n^2) but if anyone can explain me this para in simplified way it will be great help.
asked Apr 14, 2017 in Algorithms Vishal Upadhayay 106 views
1 vote
1 answer
2
251 views
#include<stdio.h> int main(){ int (*a)[5]; int arr[5][5]={ {10,65,300,400,500}, {100,20,3000,40,5000} }; a = arr; ++a ; char *ptr = (char*)*a; ++a ; printf("%d %d %d",**a,*arr[1],*ptr); return 0; }
asked May 7, 2019 in Programming kaveeshnyk 251 views
2 votes
2 answers
3
224 views
output of the following program is 'no' but why. #include <stdio.h> int main() { if (sizeof(int) > -1) printf("Yes"); else printf("No"); return 0; }
asked Jul 5, 2017 in Programming Khushal Kumar 224 views
5 votes
3 answers
4
...