30am - 9.30am Duration : 60 Minutes Number of Pupils : 20 Pupils Class Descriptions : Intermediate Theme : World Of Stories Topic : Simple Past Tense ( regular & irregular verbs ) Skills : Listening‚ Reading and Writing Learning Standards : 5.1.3 Objectives : Pupils should be able to; (i) identify the irregular and regular forms of verbs in the story. (ii) answer 4 out of 6 questions using irregular form of verbs in sentences correctly. Teaching Aids : Text of the story / Words
Premium Past tense Grammatical tense Grammatical conjugation
JLex [pic] Contents • Overview • Format of a JLex Specification o Regular Expression Rules ▪ Test Yourself #1 o JLex Directives ▪ Test Yourself #2 o Comments • yyline and yytext • A Small Example • Quick Reference Guide Overview JLex is a scanner generator that produces Java code. Here’s a picture illustrating how to create and run a program using JLex: +-----------+ JLex
Premium
Complexity Regular Expressions Sanjit A. Seshia EECS‚ UC Berkeley Acknowledgments: L.von Ahn‚ L. Blum‚ M. Blum The Picture So Far DFA NFA Regular language S. A. Seshia 2 1 Today’s Lecture DFA Regular language NFA Regular expression S. A. Seshia 3 Regular Expressions • What is a regular expression? S. A. Seshia 4 2 Regular Expressions • Q. What is a regular expression? • A. It’s a “textual”/ “algebraic” representation of a regular language
Premium
Lecture Two Lexical Analysis 1 What is Lexical Analysis? Lexical Analyzer reads the source program character by character to produce tokens. Normally a lexical analyzer doesn’t return a list of tokens at one shot‚ it returns a token when the parser asks a token from it. source program lexical analyzer token parser get next token symbol table 2 The lexical analyzer deals with small-scale language constructs‚ such as names and numeric literals. The syntax analyzer deals
Premium
FSMs and PDAs. We show that FSMs recognize exactly the regular languages‚ languages defined by regular expressions and generated by regular grammars. We also provide an algorithm to find a FSM that is equivalent to a given FSM but has the fewest states. We examine language recognition by PDAs and show that PDAs recognize exactly the context-free languages‚ languages whose grammars satisfy less stringent requirements than regular grammars. Both regular and context-free grammar types are special cases of
Premium
Lexical Analysis Made with OpenOffice.org 1 The role of lexical analyzer: analyzer: It is the first phase of a compiler. compiler. Its main task is to read the input characters & produce as output a sequence of tokens that the parser uses for syntax analysis. analysis. Upon receiving a “get next token” command from the parser‚ the lexical analyzer reads input characters until it can identify the next token. token. It may also perform certain secondary tasks at the user interface. interface
Premium Programming language
REGULAR / IRREGULAR VERBS The English language uses both regular and irregular verbs. When forming the past tense or the present/past perfect tense of these verbs‚ we use different methods. To form the past tense of a regular verb ending with a vowel (a‚ e‚ i‚ o‚ u)‚ add a d to the word. To form the present/past perfect tense‚ add a d plus a helping verb (have‚ had‚ or has). For example‚ the verb share ends with the vowel e. share = present tense shared (share + d) = past tense had shared
Premium Past tense Grammatical tense Grammatical conjugation
Function Arguments Naming Conventions ○ Classes ○ Functions and Methods ○ Variables Indentation String Concatenation Single Line Statements Comparison Operations Switch Structures Parentheses Ternaries Type Casting Constants Comments ○ One-line Comments Regular Expressions ● ● ● ● ● ● ● ● ● ● ● ● Reference: http://kohanaframework.org/3.2/guide/kohana/conventions Syntax Highlighter: https://snipt.net File and Directory Names 1. CamelCased should not be used. 2. Should be lowercase. Example:
Premium
Tutorials Point‚ Simply Easy Learning Javascript Tutorial Tutorialspoint.com Javascript is a scripting language produced by Netscape for use within HTML Web pages. JavaScript is loosely based on Java and it is built into all the major modern browsers. This tutorial gives an initial push to start you with Javascript. For more detail kindly check tutorialspoint.com/javascript What is JavaScript ? JavaScript is: JavaScript is a lightweight‚ interpreted programming language Designed
Premium Variable Java Programming language
T U R E 3 Context-Free Grammars 1 Where are Context-Free Grammars (CFGs) Used? CFGs are a more powerful formalism than regular expressions. They are more powerful in the sense that whatever can be expressed using regular expressions can be expressed using grammars (short for context-free grammars here)‚ but they can also express languages that do not have regular expressions. An example of such a language is the set of well-matched parenthesis. Grammars are used to express syntactic rules
Premium Syntax Programming language