1 votes 1 votes The lexical analysis for a modern computer language like Java necessarily needs the power of which one of the following machine models? Turing machine Non-deterministic Pushdown automata Finite automata Deterministic Pushdown automata Compiler Design uppcl2018 compiler-design lexical-analysis + – admin asked Jan 5, 2019 • recategorized Apr 18, 2022 by Lakshman Bhaiya admin 260 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.