1 votes 1 votes Whether a given pattern constitutes a token or not (a) depends on the source language (b) depends on the target language (c) depends on the compiler (d) none of the above comment is true Compiler Design compiler-design compiler-tokenization + – goluabhinan asked Sep 16, 2018 goluabhinan 4.3k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Navneet Kalra commented Sep 16, 2018 reply Follow Share I think it depends upon how the FA Automata is constructed for lexical phase of compiler to accept the pattern or not so it will be depending upon the compiler 0 votes 0 votes Shaik Masthan commented Sep 16, 2018 reply Follow Share as per my knowledge given pattern constitutes a token or not depends upon the source language. if the pattern is in source language, then it should constitute a token, otherwise why that pattern exist? Compiler ( Specific to a language ) should be implement all patterns ( in that source language ) 1 votes 1 votes goxul commented Sep 16, 2018 reply Follow Share It depends on the programmer - how he's defined the tokens. 0 votes 0 votes Shaik Masthan commented Sep 16, 2018 reply Follow Share @goxul every token should have a pattern. 0 votes 0 votes Please log in or register to add a comment.