-
Institution:
-
Ohio University-Main Campus
-
Subject:
-
Computer Science
-
Description:
-
Prereq: . (winter) Practical and formal aspects of computing related to the lexical and syntactic analysis stages of compilation are explored. The relationships among regular expressions, deterministic finite automata, and nondeterministic finite automata are presented. The relationship between contest-free grammars and pushdown automata is also explored. Practical parsing algorithms are examined, including bottom-up, town-down, and recursive descent strategies. May be retaken three times excluding withdrawals, but only last course taken counts.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(740) 593-1000
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.