搜索资源列表
pl sql web design.rar
- 用oracle pl/sql构建web网上商店
PL-1061D_IDE-CF_Driver_Report
- PL-1061D IDE-CF Driver Report.doc
-IO_Cable-PL-2303-Drivers-Generic-Windows-wd_pl230
- PL-2303 Windows 64-bit Driver v2.0.1.8
PL／0编译程序
- PL／0语言的文法规则 说明 (1)对原PL／0编译程序作了如下修改： 1’增加了输入文件ff和fi,输出文件fw2。 2’增加了保留字read和write，使保留字个数增至13。 3’关系运算符中的>=、<=和<>改为在过程getsym中说明。 4’在过程interpret中增加了读和写操作。 (2)预先建立PL／0语言源程序文件ff和其所需要的数据文件fi(文件名预先确定)。 (3)运行时在键盘上根据提示信息键入输出文件fw2的文件名(自行随时确定)。-PL / 0
PL.SQL.Developer.v7.1.5
- PL/SQL Developer是一种集成的开发环境，专门用于开发、测试、调试和优化Oracle PL/SQL存储程序单元，比如触发器等。PL/SQL Developer功能十分全面，大大缩短了程序员的开发周期。强大的PL/SQL编辑器,完善的Debugger调试器（需要Oracle 7.3.4或以上版本）询问创建\SQL视窗\命令视窗\报告视窗\项目\浏览器\过程优化\HTML手册\Non-PL/SQL目标\模板目录\比较用户目标\输出用户目标\工具\lug-In扩展\Multi-thread
PL0
- PL/0文法分析器 开发工具 VS2008 使用语言C-PL/0 grammar parser development tool VS2008 use the language C++
pl
- 从n个不同元素中任取m（m≤n）个元素，按照一定的顺序排列起来，叫做从n个不同元素中取出m个元素的一个排列。当m＝n时所有的排列情况叫全排列。-N elements from any different from m (m ≤ n) elements, in accordance with certain order, and called from the n different elements out of m elements of a array. When m = n when th
PL2303_Driver_Installer
- PL-2303 Driver PL-2303 Driver-PL-2303 Driver
throughput.pl
- This a perl file that helps you plot a throughput graph using ns2-This is a perl file that helps you plot a throughput graph using ns2
PL-0
- PL/0语言的BNF描述（扩充的巴克斯范式表示法）
PL-2303
- PL-2303USB转RS232控制器PDF中文资料-failed to translate
C++.dla.kazdego.doc.PL.eBook-dobre
- C++ dla każ dego. Wersja PL
PL--0-language-compiler
- 。通过跟踪PL/0 语言编译程序对一段示例程序进行处理的内部过程，对构成语言 编译技术的主要组成部分即词法分析、语法分析、中间代码生成、存储器分配、表格管理、错误处理等过程进行了重 点分析，详细叙述了其工作原理与实现机制以及相互之间的关系。-. By tracking the PL/0 language compiler for processing of a sample program of internal processes, language compiler technolo
pl-log
- 这个是对PL-logdist和PL-lognormal的一个仿真。程序简单易懂，但是意义不小。有专门的画图子程序。-This is a PL-logdist and PL-lognormal a simulation. Procedures are simple, but the meaning is not small. Have a special drawing routines.
count_word.pl
- Write a Perl scr ipt count_word.pl which counts the number of times a specified word is found on in its input (STDIN). A word is as defined for the previous exercise. The word you should count will be specified as a command line argument.
frequency.pl
- Write a Perl scr ipt frequency.pl which prints the frequency with each poet uses a word specified as argument. So if Robert Frost uses the word snow 30 times in the 21699 words of his poetry you are given, then its frequency is 30/21699 = 0.001382552
identify_poet.pl
- Write a Perl scr ipt identify_poet.pl that given 1 or more files, each containing a poem, prints the most likely poet per file. For each poet you calculate the log-probability that they wrote it by summing the log-probability of that poet using each
grib2ctl
- 将grib2ctl.pl变成.ctl时所需要的起始文件(The starting file needed to change grib2ctl.pl into.Ctl)
pl
- Processing documents
grib2ctl
- 将grib2ctl.pl变成.ctl时所需要的脚本代码源文件(The starting file needed to change grib2ctl.pl into.Ctl))