此程序共有兩個類，Lexical進行詞法分析，Syntax進行語法分析.對于語法分析，采用LR(1)分析法，判斷程序是否滿足規定的結構
標簽： 程序
上傳時間： 2014-01-01
上傳用戶：偷心的海盜
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
標簽： project implement developed Database
上傳時間： 2013-12-25
上傳用戶：semi1981
語法分析器 此程序共有兩個類，Lexical進行詞法分析，Syntax進行語法分析.對于語法分析，采用LR(1)分析法，判斷程序是否滿足規定的結構.
上傳時間： 2013-12-04
上傳用戶：四只眼
Lua is a powerful, light-weight programming language designed for extending applications. It is also frequently used as a general-purpose, stand-alone language. It combines simple procedural syntax (similar to Pascal) with powerful data description constructs based on associative arrays and extensible semantics. Lua is dynamically typed, interpreted from bytecodes, and has automatic memory management with garbage collection, making it ideal for configuration, scripting, and rapid prototyping.
標簽： applications light-weight programming extending
上傳時間： 2016-01-13
上傳用戶：1101055045
Hidden_Markov_model_for_automatic_speech_recognition This code implements in C++ a basic left-right hidden Markov model and corresponding Baum-Welch (ML) training algorithm. It is meant as an example of the HMM algorithms described by L.Rabiner (1) and others. Serious students are directed to the sources listed below for a theoretical description of the algorithm. KF Lee (2) offers an especially good tutorial of how to build a speech recognition system using hidden Markov models.
標簽： Hidden_Markov_model_for_automatic speech_recognition implements left-right
上傳時間： 2016-01-23
上傳用戶：569342831
This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
標簽： code implementing directory algorithm
上傳時間： 2014-01-15
上傳用戶：woshini123456
This ECMA Standard specifies the form and establishes the interpretation of programs written in the C# programming language. It specifies The representation of C# programs The syntax and constraints of the C# language The semantic rules for interpreting C# programs The restrictions and limits imposed by a conforming implementation of C#.
標簽： the interpretation establishes specifies
上傳時間： 2013-12-18
上傳用戶：chenjjer
JavaServer Pages, Third Edition is completely revised and updated to cover the substantial changes in the 2.0 version of the JSP specification. It also includes detailed coverage of the major revisions to the JSP Standard Tag Library (JSTL) specification. Combining plenty of practical advice with detailed coverage of JSP syntax and features and clear, useful examples, JavaServer Pages, Third Edition demonstrates how to embed server-side Java into Web pages, while also covering important topics such as JavaBeans, Enterprise JavaBeans (EJB), and JDBC database access.
標簽： substantial JavaServer completely Edition
上傳時間： 2014-01-04
上傳用戶：mpquest
k-meansy算法源代碼。This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
標簽： code implementing directory algorithm
上傳時間： 2016-04-07
上傳用戶：shawvi
語法分析是編譯程序的核心部分,其主要任務是確定語法結構,檢查 語法錯誤，報告錯誤的性質和位置，并進行適當的糾錯工作.法分析的方法有多種多樣，常用的方法有遞歸子程序方法、運算符優先數法、狀態矩陣法、LL（K）方法和LR（K）方法。歸納起來，大體上可分為兩大類，即自頂向下分析方法和自底向上分析方法. Syntax進行語法分析.對于語法分析，這里采用LR(1)分析法，判斷程序是否滿足規定的結構.構造LR(1)分析程序，利用它進行語法分析，判斷給出的符號串是否為該文法識別的句子，了解LR（K）分析方法是嚴格的從左向右掃描，和自底向上的語法分析方法。
上傳時間： 2014-01-04
上傳用戶：bibirnovis
