Skip to content

Compiler Design

Which of the following best describes Lexical pattern matching?

Difficulty: Medium

Correct answer

C. The use of regular expressions by a lexical analyzer to define and recognize valid tokens.

Correct answer

Source: Compiler Design Official Reference Guide

Tags: computer science, compiler design, compilers, programming languages

Submitted by: MCQsHub Editorial

Related MCQs

More Compiler Design MCQs